#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define sz size()
#define ff first
#define ss second
#define mod 1000000007
#define pie 3.14159265359
#define minheap priority_queue<int , vector<int> , greater<int> > 
#define maxheap priority_queue<int> 	
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL) ;
#define INF 1000000000000000
#define debug(n) cout<<#n<<" "<<n<<"\n";
int main()
{
	fast;
	int t;
	cin>>t;
	while(t--)
	{
		ll n,i,j;
		cin>>n;
		ll a[n];
		ll ct=0;
		ll ans=1;
		for(i=0;i<n;i++)
		{
			cin>>a[i];
			if(a[i]<=0)
			ct++;
		}
		ans=max(ans,ct);
		sort(a,a+n);
		ll midif=INT_MAX;
		ll ind=-1;
		for(i=0;i<n;i++)
		{
			if(a[i]>0)
			{
				ind=i;
				break;
			}
			if(i+1<n)
			midif=min(midif,abs(a[i]-a[i+1]));
		}
		if(ind==-1)
		{
			cout<<ans<<"\n";
			continue;
		}
		if(ind==0)
		{
			cout<<ans<<"\n";
			continue;
		}
		midif=min(midif,abs(a[ind]-a[ind-1]));
		if(midif>=a[ind])
		{
			ans++;
		}
		cout<<ans<<"\n";
	}
	
}