#include "bits/stdc++.h"
using namespace std;

const int MX = 1e5 + 5;
const int INF = 2e9;

int N, A[MX];

void solve() {
	cin >> N;
	for (int i = 0; i < N; i++) cin >> A[i];
	sort(A, A + N);
	
	int bZ = 0, Z = 0, aZ = 0;
	for (int i = 0; i < N; i++) {
		if (A[i] == 0) Z++;
		if (A[i] > 0) aZ++;
		if (A[i] < 0) bZ++;
	}

	int ans = bZ + Z;
	if (aZ) {
		// can we include the min value > 0.
		bool good = 1;
		int x = 0;
		for (int i = 0; i < N; i++) {
			if (A[i] > 0) {
				x = A[i];
				break;
			}
		}

		for (int i = 1; i < N; i++) if (A[i] < 0) {
			if (A[i] - A[i - 1] < x) good = 0;
		}
		if (good) ans = max(ans, bZ + min(Z, 1) + 1);
		ans = max(ans, 1);
	}
	cout << ans << "\n";
}

int main() {
	int t; cin >> t;
	while (t--) {
		solve();
	}
}