#include<bits/stdc++.h>

using namespace std;
typedef long long ll;

const ll ZERO = 0;

void solve() {
	ll n;
	cin >> n;
	vector<ll> a(n);
	map<ll, ll> cnt;
	for (ll i = 0; i < n; i++) {
		cin >> a[i];
		cnt[a[i]]++;
	}

	ll tot = cnt[-1] + cnt[0] + cnt[1];
	ll d = tot / 2;
	if (tot & 1) {
		d = tot / 2 + 1;
	}

	ll swaps = max(ZERO, d - cnt[1]);

	ll num_b = 1, tot_a = 1;
	for (ll i = 0; i < n; i++) {
		if (a[i] == 0) {
			if (num_b == 1 || swaps > 0) {
				a[i] = 1;
				swaps--;
			} else {
				a[i] == -1;
			}
		}

		if (a[i] == 1) {
			num_b++;
			tot_a++;
		} else {
			num_b--;
		}

		// cout << "A " << tot_a << " " << num_b << endl;

		if (num_b <= 0) {
			cout << -1 << endl;
			return;
		}
	}

	ll g = gcd(num_b, tot_a);

	cout << tot_a / g << " " << num_b / g << endl;

	return;
}

signed main() {
	cin.tie(0)->sync_with_stdio(0);
	cin.exceptions(cin.failbit);

	ll t;
	cin >> t;

	while (t--) {
		solve();
	}

}