#include<bits/stdc++.h>
#define endl '\n'

using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;

const int N = 2e5 + 5;
int n, m, k, x, y, T;

void solve()
{
	cin >> n;
	vector<int> a(n + 1);
	vector<int> suf(n + 2);
	for(int i = 1; i <= n; i ++) cin >> a[i];
	
	// 1 1 0 -1 1 1 1 1 0 -1 -1 -1
	for(int i = n; i >= 1; i --){
		if(a[i] == -1) suf[i] = suf[i + 1] + 1;
		else if(a[i] == 0) suf[i] = suf[i + 1];
		else suf[i] = 0;
	}
	
	//0 0 0 -1 -1
	int cnt = 1, sum = 1;
	for(int i = 1; i <= n; i ++){
		if(a[i] == 1) sum ++, cnt ++;
		else if(a[i] == -1){
			cnt --;
			if(cnt <= 0){
				cout << -1 << endl;
				return;
			}
		}
		else if(a[i] == 0){
			if(cnt > suf[i + 1] + 1){
				cnt --;
			}
			else sum ++, cnt ++;
		}
		else sum ++, cnt ++;
		//cout << sum << ' ' << cnt << endl;
	}
	
	cout << sum / __gcd(sum, cnt) << ' ' << cnt / __gcd(sum, cnt) << endl;
}

int main()
{
	ios::sync_with_stdio(false), cin.tie(0);
	
	cin >> T;
	while(T--) solve();
	
	return 0;
}