#include<bits/stdc++.h>
using namespace std;
using ll=long long;
const int mod=1e9+7;

void solve(){
    int n; cin>>n;
    vector<ll> v,u;
    set<ll> se;
    ll s;
    for(auto i=0;i<n;i++){
        cin>>s;
        if(s>0) v.push_back(s);
        else u.push_back(s);
    }
    sort(v.begin(),v.end());
    sort(u.begin(),u.end());
    // int i=0,cnt=0;
    // while(v[i]<=0){
    //     cnt++;
    //     m[v[i]]=cnt;
    // }
    if(u.size()==0){
        cout<<1<<endl;
        return;
    }
    if(v.size()==0){
        // for(auto x:u) se.insert(x);
        cout<<u.size()<<endl;
        return;
    }
    ll f=v[0],mn=u[u.size()-1];
    ll mxc=0;
    int i=u.size()-1;
    // for(int j=0;j<v.size();j++){
    //     ll cc=0;
        for(int k=u.size()-2;k>=0;k--){
            if(abs(u[k]-u[i])>=f){                
                // cout<<u[k]<<" "<<u[i]<<endl;
                i=k;
                mxc++;
            }
            else{
                if(u[k]==u[i]) i--;
            }
        }
        mxc+=2;
        if(mxc>=u.size())
        cout<<mxc<<endl;
        else cout<<u.size()<<endl;
        return;
    // }
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr); cout.tie(nullptr);
    int t; cin>>t;
    while(t--) solve();
}