#include<bits/stdc++.h>
#define ll long long int
#define vll vector<ll>
#define um unordered_map<ll,ll>
using namespace std;

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    ll t;
    cin>>t;
    while(t--){
        ll n;
        cin>>n;
        vll a(n);
        for(ll i=0;i<n;i++) cin>>a[i];
        sort(a.begin(),a.end());
        priority_queue<ll, vector<ll>,greater<ll> > q;
        ll count=n;
        for(ll i=0;i<a.size()-1;i++){
            q.push(a[i+1]-a[i]);
            if(q.top()<a[i+1]){
             count = i+1;
             break;
            }
            
        }
        cout<<count<<endl;
    }
    return 0;
}