#include <bits/stdc++.h>
#define fast ios_base::sync_with_stdio(0);
#define io cin.tie(0); cout.tie(0)
#define endl '\n'
#define for_t int t; cin >> t; while (t--)
#define pb push_back

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef set<int> si;
typedef pair<int, int> pii;
typedef pair<long, int> pli;
typedef pair<int, long> pil;
typedef vector<pii> vpii;
typedef vector<pil> vpil;
typedef vector<pli> vpli;

template<typename T>
void print(T t)
{
    cout << t << endl;
}
template<typename T, typename ...F>
void print(T t, F ...f)
{
    cout << t << " ";
    print(f...);
}

template<typename T>
void input_array(vector<T> &arr)
{
    for (int i = 0; i < arr.size(); i++)
    {
        cin >> arr[i];
    }
}

template<typename T>
void print_array(T arr, char c = ' ')
{
    for (auto x : arr)
    {
        cout << x << c;
    }
    cout << endl;
}


int main()
{
    fast io;
    int n;
    for_t
    {
        cin >> n;
        vll a(n);
        input_array(a);
        int ans = 0;
        int b = 0;
        vll res;
        for (int i = 0; i < n; i++)
        {
            if (a[i] <= 0)
            {
                ans++;
                if (a[i] == 0) b++;
                res.pb(a[i]);
            }
        }
        if (ans == 0) ans = 1;
        else
        {
            ll max_= *max_element(a.begin(), a.end());
            if (max_ > 0 && b < 2)
            {
                ll min_diff = LONG_LONG_MAX;
                sort(res.begin(), res.end());
                for (int i = 1; i < res.size(); i++)
                {
                    if (abs(res[i-1] - res[i]) < min_diff) min_diff = abs(res[i-1] - res[i]);
                    if (min_diff == 0) break;
                }
                // print(min_diff);
                if (min_diff)
                {
                    // int max_seq = *max_element(res.begin(), res.end());
                    for (int i = 0; i < n; i++)
                    {
                        if (a[i] > 0 && a[i] <= min_diff)
                        {
                            ans++;
                            break;
                        }
                    }
                }
            }
        }
        print(ans);
    }
    return 0;
}