#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxN = 100000 + 5;
int n, ks;
ll a[maxN];
int main()
{
    cin >> ks;
    while(ks --) {
        scanf("%d", &n);
        a[0] = 0;
        for (int i = 1; i <= n; i ++) {
            scanf("%lld", &a[i]);
        }
        int ans = 0, numOfZeros = 0;
        ll MAX = -1;
        sort(a + 1, a + n + 1);
        for (int i = 1; i <= n; i ++) {
            if (a[i] <= 0) {
                ans ++;
                if (i == 2) MAX = a[2] - a[1];
                else MAX = min(MAX, a[i] - a[i-1]);
                if (!a[i]) numOfZeros ++;
            }
            else {
                if (numOfZeros >= 2) break;
                if (MAX < 0 || MAX >= a[i]) {
                    ans ++;
                    break;
                }
            }
        }
        printf("%d\n", ans);
    }
}