#include<bits/stdc++.h>
#define INF 0x3f3f3f3f
#define PI acos(-1)
#define endl "\n"
#define int long long
#define pb push_back
#define fi first
#define se second
using namespace std;
typedef pair<int, int> PII;
typedef unsigned long long ULL;
const int N = 1e6+5,mod=1e9+7,modd=998244353;
int ar[N],br[N];
int  k, s,n,m,sum1,len;
int cmp(int a, int b){	return a > b;}
int lowbit(int x){return x&(-x);}
int read() { int x=0,f=1; char c=getchar(); while(c<'0'||c>'9'){if(c=='-') f=-1;c=getchar();}
	while(c>='0'&&c<='9') x=x*10+c-'0',c=getchar();return x*f;}
const double eps = 1e-8;
signed main()
{
	
	int t=1;
	ios_base::sync_with_stdio(false);cin.tie(0); cout.tie(0);
	
	cin>>t;
	for(int ff=1;ff<= t;ff++)
	{
		int a, b,c,d, l, y, x, s, r,flag = 0,idx = 0,gg = 0,hh=0,res=0,sum=0, sum2 = 0;
		string str2,str,str3;
		
		cin>>n;
		vector<int>ve;
		flag=1;
		for(int i=1;i<=n;i++)cin>>ar[i];
		sum=1,gg=1;
		for(int i=1;i<=n;i++)
		{
			if(ar[i]==1)sum++,gg++;
			else if(ar[i]==-1)
			{
				if(gg>=2)gg--;
				else if(hh>=1)//之前第一个操作三改变
				{
					hh--;
					sum++;
					gg+=2;gg--;
				}
				else{
					flag=0;
					break;
				}
			}
			else 
			{
				
				if(gg>=2)gg--,hh++;//2
				else sum++,gg++;//1
			}
		}
		if(flag==0)cout<<-1<<endl;
		else cout<<sum/__gcd(sum,gg)<<" "<<gg/__gcd(sum,gg)<<endl;
	}
	return 0;
}