#include<bits/stdc++.h>

using namespace std;
typedef long long ll;

const ll ZERO = 0;

void solve() {
	ll n;
	cin >> n;

	ll a, cnt_0 = 0;
	ll tot_a = 1, tot_n = 1;
	bool flag = true;
	for (ll i = 0; i < n; i++) {
		cin >> a;

		if (a == 0) {
			if (tot_n > 1) {
				tot_n--;
				cnt_0++;
			} else {
				tot_a++;
				tot_n++;
			}
		} else if (a == -1) {
			if (tot_n > 1) {
				tot_n--;
			} else if (tot_n == 1 && cnt_0 > 0) {
				tot_n++;
				tot_a++;

				cnt_0--;
			} else {
				flag = false;
			}
		} else {
			tot_a++;
			tot_n++;
		}
	}

	if (!flag) {
		cout << -1 << endl;
		return;
	}

	ll g = gcd(tot_a, tot_n);

	cout << tot_a / g << " " << tot_n / g << endl;
	
}

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

	ll t;
	cin >> t;

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

}