#include <bits/stdc++.h>
using namespace std;
#define ll            long long
#define float         long double
#define pb            push_back
#define F             first
#define S             second
#define endl          '\n'
#define ceil(a)       (ll) ceil(a)
#define floor(a)      (ll) floor(a)
#define PI            3.14159265358979323846
#define pll           pair<ll,ll>
#define vll           vector<ll>
#define vpll          vector<pair<ll,ll>>
#define mll           map<ll,ll>
#define f(i,a,b)      for(ll i=a;i<b;i++)
#define rev(i,a,b)    for(ll i=a;i>=b;i--)
#define all(a)        (a).begin(),(a).end()
#define debug(x)      cout<<#x<<" is "<<(x)<<endl;cout.flush();
// #define debug(x)      ;
#define si(x)         (ll)((x).size())
#define fast          ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define txt           freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
const ll M=1e9+7;
void inp(ll a[],ll n)
{
    f(i,0,n) cin>>a[i];
}

void solve()
{   
    ll n;
    cin>>n;
    ll a[n];
    inp(a,n);
    sort(a,a+n);
    if(a[n-1]<=0)
    {
        cout<<n<<endl;
        return ;
    }
    ll x,q;
    f(i,0,n)
    {
        if(a[i]>0)
        {
            x=a[i];
            q=i;
            break;
        }
    }
    f(i,0,n)
    {
        if(a[i]==x)break;
        ll y=abs(a[i]-a[i+1]);
        if(y<x)
        {
            cout<<q<<endl;
            return ;
        }
    }
    cout<<q+1<<endl;

}
int main()
{
    fast
    ll t=1;
    cin>>t;
    while(t--)
    solve();
}
