#include<iostream>
#include<vector>
#include<cstring>
#include<algorithm>
#include<cstdio>
#include<queue>
#include<string.h>
#include <string>
#include<math.h>
#include<cmath>
#include<set>
#include<unordered_map>
#include<unordered_set>
#include<map>
#include<queue>
#include<stack>
#include<functional>
#include<deque>
#define int long long
#define IOS ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define inf 1e18
using namespace std;
const int N = 2e5 + 7;
const int M = 1e6 + 7;
vector<int>a;
int n;
bool check(int x)
{
	int sum = 1, nu = 1;
	for (int i = 1; i <= x; i++)
	{
		if (a[i] == 1 || a[i] == 0)sum++, nu++;
		else nu--;
		if (nu <= 0)return false;
	}
	for (int i = x + 1; i <= n; i++)
	{
		if (a[i] == -1 || a[i] == 0)nu--;
		else sum++, nu++;
		if (nu <=0)return false;
	}
	return true;
}
int gcd(int a, int b) {
	return b ? gcd(b, a % b) : a;
}
void solve()
{
	cin >> n;
	a.resize(n + 1,0);
	for (int i = 1; i <= n; i++)
	{
		cin >> a[i];
	}
	int l = -1, r = n + 1;
	while (l + 1!= r)
	{
		int mid = (l + r) >> 1;
		if (check(mid))r = mid;
		else l = mid;
	}
	if (l == n)cout << -1 << endl;
	else
	{
		int sum = 1, nu = 1;
		for (int i = 1; i <= r; i++)
		{
			if (a[i] == 1 || a[i] == 0)sum++, nu++;
			else nu--;
		}
		for (int i = r + 1; i <= n; i++)
		{
			if (a[i] == -1 || a[i] == 0)nu--;
			else sum++, nu++;
		}
		int gg = gcd(sum , nu);
		sum = sum / gg;
		nu = nu / gg;
		cout << sum << " " << nu << endl;
	}
}
signed main() {
	IOS;
	int t = 1; cin >> t;
	while (t--) {
		solve();
	}
}