#include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define int long long int
#define pb push_back
#define debug1(x) cout<<#x<<" "<<x<<endl;
#define debug2(x,y) cout<<#x<<" "<<x<<" "<<#y<<" "<<y<<endl;
#define debug3(x,y,z) cout<<#x<<" "<<x<<" "<<#y<<" "<<y<<" "<<#z<<" "<<z<<endl;
#define present(c,x) ((c).find(x) != (c).end())
#define null NULL
#define pi pair<int,int>
#define sz(x)	(int)x.size()
#define fi first
#define se second
#define boost ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define inf 1e17
#define flush fflush(stdout);
#define fr(i,a,b) for(int i=a;i<b;i++)
#define all(x) (x).begin(),(x).end()
#define prDouble(x) cout<<fixed<<setPrecision(10)<<x
const int N=100000;
void solve(){
    int n;
    cin>>n;
    int a[n];
    for(int i=0;i<n;i++){
        cin>>a[i];
    }
    if(n==1)
    {
        cout<<"1\n";
        return;
    }
    sort(a,a+n);
    int ans=1;
    int diff=INT_MAX;
    int i=1;
    if(a[0]>0)
    {
        cout<<"1\n";
        return;
    }
    for(;i<n;i++){
 if(a[i]>0)
    break;
    if(a[i]==0&&a[i-1]==0){
        int cnt=0;
        while(i<n&&a[i]==0){
            cnt++;
            i++;
        }
        cout<<ans+cnt<<"\n";
        return;
    }
         diff=min(diff,abs(a[i]-a[i-1]));
         ans++;
   
    }
    // for(;i<n;i++){
    //     if((a[i]-a[i-1])>)
    // }
    if(i!=n)
    {
        if((a[i])<=(diff)){
            ans++;
        }
    }
    cout<<ans<<"\n";
}





int32_t main(){
    boost;
    int t;
    cin>>t;
    while(t--){
        solve();
    }
}