// Jai Shree Ram

#include<bits/stdc++.h>
typedef long long int ll;
#define pb push_back
#define max2(a,b) (a>b)?a:b
#define mi2(a,b) (a<=b)?a:b
#define fori(i,n) for(ll i=0;i<(ll)n;i++)
#define ford(i,n) for(ll i=n;i>=0;i--)
#define pll pair<ll,ll>
#define mod 1000000007
#define ff first
#define ss second
using namespace std;
#define MAXI 1e15
#define MAX_LIMIT 500001


void solve()
{
    
    ll n;
    cin>>n;
    vector<ll> v(n),neg;
    ll pos=MAXI;
    bool fl=0;
    fori(i,n)
    {
        cin>>v[i];
        if(v[i]<=0)
        {
            neg.pb(v[i]);
        }
        else if(v[i]>0)
        {
            fl=1;
            pos=min(pos,v[i]);
        }
    }
    sort(neg.begin(),neg.end(),greater<ll>());
    ll ans=neg.size();
    if(fl==0)
    {
        
        cout<<ans<<"\n";
        return;
    }
    else
    {

        ll mini=MAXI;
        for(int i=1;i<neg.size();i++)
        {
            ll val=abs(neg[i]-neg[i-1]);
            mini=min(mini,val);
        }
       
            
            if(mini>=pos)
            {
                ans++;
            }

        
        
       
        cout<<ans<<"\n";
        return;
        

    }


    






}
 

 
int main()
{
     

 
    ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);




    
    ll T;
    T=1;
    cin>>T;
    
    fori(_,T)
    {
        
        solve();
        
    }
    
   
 
 
    
 
}
