#include <bits/stdc++.h>

using namespace std;


int elem[100005];
int tmp[100005];
int main()
{
    int t;
    cin >> t;

    int n;
    while (t--) {
        cin >> n;
        int cnt_f = 0, cnt_z = 0;
        int min_z = 0x7f7f7f7f;
        for (int i = 0; i < n; i++) {
            cin >> elem[i];
            if (elem[i] < 0) 
                tmp[cnt_f++] = elem[i];
            else if (elem[i] == 0)
                cnt_z++;
            else
                min_z = min(min_z, elem[i]);
        }

        int ans = 1;
        if (cnt_f == 0) {
            if (cnt_z != 0) {
                if (min_z == 0x7f7f7f7f || cnt_z >= 2) {
                    ans = cnt_z;
                }
                else 
                    ans = 2;
            }
        }
        else if (cnt_z >= 2 || min_z == 0x7f7f7f7f)
            ans = cnt_f + cnt_z;
        else {        
            int t = cnt_f;
            if (cnt_z != 0)
                tmp[t++] = 0;
            if (cnt_z + cnt_f == 1)
                ans = 2;
            else {           
                sort(tmp, tmp + t);
                int minDis = 0x7f7f7f7f;
                for (int i = 1; i < t; i++)
                    minDis = min(minDis, abs(tmp[i] - tmp[i - 1]));

                if (minDis >= min_z)
                    ans = 1 + cnt_f + cnt_z;
                else
                    ans = cnt_z + cnt_f;
            }
        }
        cout << ans << endl;
    }
    return 0;
}

