#include<stdio.h>
#include<math.h>
void quick_sort(double s[], int l, int r)
{
    if (l < r)
    {
        double x = s[l];
        int i = l, j = r;
        while (i < j)
        {
            while(i < j && s[j] >= x)
                j--;
            if(i < j)
                s[i++] = s[j];

            while(i < j && s[i] < x)
                i++;
            if(i < j)
                s[j--] = s[i];
        }
        s[i] = x;
        quick_sort(s, l, i - 1); // 递归调用 分治思想 左边分治
        quick_sort(s, i + 1, r);    //右边分治
    }
}
int main()
{
    int m, n;
    scanf("%d",&m);
    while (m--)
    {
        scanf("%d",&n);
        int i;
        double a[600];
        for (i = 0; i < n; i++)
            scanf("%lf",&a[i]);
        quick_sort(a, 0, n - 1);  //排序
        double length = 0;
        int num = 0;
        for (i = n - 1; i >= 0; i--)
        {
            if (length < 20)  //判断是否大于总长度
            {
                length = length + sqrt(a[i]*a[i] - 1) * 2.0;
                num++;
            }
        }
        printf("%d\n",num);
    }
    return 0;
}
--------------------------------------------------------------------------------