#include <bits/stdc++.h>
/*#include <iostream>
#include <algorithm>
#include <math.h>
#include <iomanip>
#include <string>
#include <vector>
#include <set>
#include <sstream>*/
 
#define ll long long
#define fop(i,m,n) for(ll i=m; i<n; i++)
#define fastIO ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define X first
#define Y second
#define pb push_back
#define mp make_pair
#define all(v) v.begin(),v.end()
#define ep emplace_back
 
using namespace std;
 
const long long MOD = 998244353;
const long long N = 1e18+5;
const long long Nlog = 17;
const long long Hash = 257;
 
const double PI = 2.0*acos(0.0);//<cmath>
//const double PI = 3.141592653;
const double E = 2.718281828;
 
void solve(){
 
    int n;
    cin >> n;
    ll a[n];
    fop(i,0,n) cin >> a[i];
    sort(a, a+n);
    
    int cnt = 0;
    ll m = N;
    fop(i,0,n){
        if(i){
            m = min(m, a[i] - a[i-1]);
        }
        if(a[i] > m) break;
        cnt++;
    }
    
    cout << cnt << '\n';
    
 
}
 
 
int main()
{
    fastIO;
 
    int t=1;
    cin >> t;
    while(t--) solve();
 
    return 0;
}