#include<bits/stdc++.h>
using namespace std;
 
#define ll long long
#define vl vector<ll>
#define ml map<ll,ll>
#define sl set<ll>
#define vp vector< pair <int,int> >
#define pb push_back
 
#define asort sort(a,a+n)
#define all(v) v.begin(),v.end()
#define vsort(v) sort(v.begin(),v.end())
 
 
#define F first
#define S second
#define mod 1000000007
 
#define mit map<ll,ll>::iterator
#define for0(j,n) for(ll i=j;i<n;i++)
#define for1(j,n) for(ll i=j;i<=n;++i)
#define MA LLONG_MAX
#define MI LLONG_MIN
 
long long power(long long x,ll y)
{
    long long res = 1; 
    x = x % mod;
    while (y > 0) 
    {
        if (y & 1)
            res = (res * x) % mod;
        y = y >> 1; 
        x = (x * x) % mod;
    }
    return res;
}
 
long modInverse(long long n)
{
    return power(n, mod - 2);
}
long long fac[200001];
 
long long ncr(long long n, ll r)
{
    if (n < r)
        return 0;
    if (r == 0)
        return 1;
    long long fac[n + 1];
    fac[0] = 1;
    for (int i = 1; i <= n; i++)
        fac[i] = (fac[i - 1] * i) % mod;
 
    return (fac[n] * modInverse(fac[r]) % mod*modInverse(fac[n - r])% mod)% mod;
} 
 void solve()
{
    ll n,i,j,m=MA,flag=0;
    cin>>n;
    vl a(n),b;
    for(ll i=0;i<n;++i)
    cin>>a[i];
    vsort(a);
    for(i=0;i<n;i++)
    {
        if(a[i]<=0)
        {
            b.push_back(abs(a[i]));
        }
        else 
        {
            m=min(a[i],m);
        }
    }
    if(m==MA)
    {
        cout<<b.size()<<endl;
        return;
    }
    for(i=0;i<(ll)b.size()-1;i++)
    {
        if(abs(b[i]-b[i+1])<m)
        {
            flag=1;
            break;
        }
    }
    ll ans=b.size();
    if(!flag)
    ans++;
    cout<<ans<<endl;
}
 
int main()
{
    ll t=1;
     fac[0] = 1;
    for (int i = 1; i <= 200000; i++)
        fac[i] = (fac[i - 1] * i) % mod;
    cin>>t;
 
    while(t--)
    {
        solve();
    }
 
    return 0;
}