#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
inline int read(){
	int x=0,k=1;char c=getchar();
	while(c<'0'||c>'9'){
		if(c=='-')k=-1;
		c=getchar();
	}
	while(c>='0'&&c<='9')x=(x<<3)+(x<<1)+(c^48),c=getchar();
	return x*k;
}
struct node{
	int x,y;
};
bool cmp(node a,node b){
	return a.x*1.0/a.y>b.x*1.0/b.y;
}
void sol(){
	int n=read();
	int a=1,b=1,c=0;
	bool f=0;
	for(int i=1;i<=n;++i){
		int t=read();
		if(t==1)++a,++b;
		else if(t==-1)--b;
		else ++a,++b,++c;
		if(b<1)f=1;
	}
	if(f){
		puts("-1");
		return;
	}
	vector<node>v;
	do{
		v.push_back({a,b});
		a--;
		b-=2;
		c--;
	}while(b>0&&~c);
	sort(v.begin(),v.end(),cmp);
	int x=v.begin()->x,y=v.begin()->y;
	int g=__gcd(x,y);
	cout<<x/g<<' '<<y/g<<endl;
}
signed main(){
	int T=read();
	while(T--)sol();
}