#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pll pair<int,int>
#define fi first
#define se second
typedef long long LL;
typedef unsigned long long ull;
int n,m,k;
const int N=1e3+10,M=1e5+10,mod=45989;
int num[N];
int res,cnt;

pll cmp(pll p1,pll p2)
{
	return p1.fi*p2.se>p2.fi*p1.se?p1:p2;
}

void solve() {
	cin>>n;
	m=0;
	int a1=1,a2=1;
	bool flag=1;
	for(int i=1;i<=n;i++)
	{
		int x;
		cin>>x;
		if(x==1) a1++,a2++;
		if(x==-1)
		{
			if(a2>1) a2--;
			else if(m) m--,a1++;
			else flag=0;
		}
		if(x==0) m++;
	}
	if(!flag)
	{
		cout<<"-1"<<endl;
		return;
	}
	pll res={a1,a2};
	for(int i=1;i<=m;i++)
	{
		if(a2+i<=m-i) break;
		res=cmp(res,{a1+i,a2+i-(m-i)});
	}
	int t=__gcd(res.fi,res.se);
	cout<<res.fi/t<<" "<<res.se/t<<endl;
}


signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int T=1;
    cin>>T;
    while(T--)solve();
    return 0;
}