#include <bits/stdc++.h>

#define FAST_IO ios_base::sync_with_stdio(false);cin.tie(NULL);
#define rep(i, n) for(int i = 0; i < n; i++)
#define run(i, a, b) for(int i = a; i < b; i++)
#define cinarr(arr, n) rep(_i, n) cin >> arr[_i]
#define cinset(st, n) int _t; rep(i, n) {cin >> _t; st.insert(_t);}
#define coutarr(arr, n) rep(_i, n) cout << arr[_i] << " "; cout << endl
#define coutvec(vec) for(auto _e: vec) cout << _e << " "; cout << endl;
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vpii vector<pii>
#define vpll vector<pll>
#define F first
#define S second
#define pb push_back
#define popb pop_back
#define pf push_front
#define popf pop_front
#define deb(...) " [" << #__VA_ARGS__ << ": " << (__VA_ARGS__) << "] "

using namespace std;

typedef long long int ll;
typedef unsigned long long int ull;

struct node {
    int min, max, cnt, headIndex;
};

int main() {
    FAST_IO

    int T;
    cin >> T;

    while (T--) {
        int n;
        cin >> n;
        vi a(n);
        cinarr(a, n);
        sort(a.begin(), a.end());
        int deltaMin = INT_MAX;
        int upto = n;
        for (int i = 1; i < upto; i++) {
            deltaMin = min(deltaMin, abs(a[i] - a[i - 1]));
            for(int j = upto - 1; j >= i; j--) {
                if(a[j] > deltaMin) {
                    upto--;
                }
            }
        }
        cout << upto << endl;
    }
}

