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

#define int long long

const int N = 1e6 + 10;

int T, n, x, y;
int a[N], g[N], v[N];

int gcd(int a, int b) {
	if (!b) return a;
	return gcd(b, a % b);
}

signed main()
{
	cin >> T;
	while (T--){
		cin >> n;
		for (int i = 1; i <= n; i++) cin >> a[i];
		
		int pos = 0;
		for (int i = n; i >= 1; i--)
			if (a[i] == -1) {
				pos = i;
				break;
			}
		for (int i = pos + 1; i <= n + 1; i++) g[i] = 1;
		for (int i = pos; i >= 1; i--) {
			if (a[i] == -1) g[i] = g[i + 1] + 1;
			else g[i] = g[i + 1] - 1;
		}
		
		x = y = 1;
		int flag = 0;
		for (int i = 1; i <= n; i++) {
			if (a[i] == 1) x++, y++;
			else if (a[i] == -1) y--;
			else {
				if (y == 1) x++, y++;
				else if (y - 1 >= g[i + 1]) y--;
				else x++, y++;
			}
			if (y <= 0) {
				flag = 1;
				break;
			}
		}
		
		if (flag) puts("-1");
		else {
			int g = gcd(x, y);
			cout << x / g << ' ' << y / g << endl;
		}
	}
	return 0;
}
/*
1
2
0 0
*/