#include<bits/stdc++.h>

using namespace std;

#define int long long
#define IOS ios_base::sync_with_stdio(0), cin.tie(0)
#define endl "\n"

vector<int> a(100005);

int32_t main(){
    IOS;
    int t, n;
    cin>>t;
    while(t--){
        cin>>n;
        a.resize(n);
        int neg = 0;
        for(int i=0; i<n; i++){
            cin>>a[i];
            if(a[i]<=0) neg++;
        }
        sort(a.begin(), a.end());
        int pos= upper_bound(a.begin(), a.end(), 0) - a.begin();
        int minimum = 1000000001;
        for(int i= 1; i<pos; i++){
            if((a[i]-a[i-1])< minimum){
                minimum = a[i] - a[i-1];
            }
        }
        int ans = 0;
        if(pos<=n-1){
            if(a[pos] <= minimum) ans++;
        }
        ans += pos;
        cout<<ans<<endl;
    }
    return 0;
}