#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
const int MAX=1e6+5;
int a[MAX],cnt,maxv,suf[MAX],n,pre_fc[MAX],pre_m[MAX];
int get_gcd(int x,int y){
	int c=x%y;
	while(c){
		x=y;
		y=c;
		c=x%y;
	}
	return y;
}
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;
}
void solve(){
	cnt=maxv=1;
	n=read();
	for(int i=1;i<=n;++i)
		a[i]=read();
	for(int i=1;i<=n;++i){
		pre_fc[i]=pre_fc[i-1];
		pre_m[i]=pre_m[i-1];
		if(a[i]==1||a[i]==0)
			pre_fc[i]++;
		else
			pre_m[i]++;
//		cout<<i<<" ("<<pre_fc[i]<<" "<<pre_m[i]<<endl;
	}
	int tmp=pre_fc[n]-pre_m[n];
	suf[n]=n;
	for(int i=n-1;i>=1;--i){
		suf[i]=suf[i+1];
		if(pre_fc[i]-pre_m[i]<tmp){
			tmp=pre_fc[i]-pre_m[i];
			suf[i]=i;
		}
	}
	for(int i=1;i<=n;++i){
		if(a[i]==1){
			cnt++;
		}
		if(a[i]==-1){
			if(cnt==1){
				printf("-1\n");
				return;
			}
			cnt--;
			maxv++;
		}
		if(a[i]==0){
			if(cnt-pre_fc[i]+pre_fc[suf[i]]>=pre_m[suf[i]]-pre_m[i]+2){
//					cout<<cnt<<" "<<"**"<<cnt-pre_fc[i]+pre_fc[suf[i]]<<" "<<pre_m[suf[i]]-pre_m[i]+1<<" "<<pre_fc[i]<<" "<<pre_fc[suf[i]]<<endl;
				cnt--;
				maxv++;
			}
			else{
				cnt++;
			}
		}
//		cout<<i<<" "<<cnt<<" ! "<<maxv<<endl;
	}
	int t=get_gcd(maxv+cnt-1,cnt);
	printf("%d %d\n",(maxv+cnt-1)/t,cnt/t);
}
int main(){
//	freopen("data.in", "r", stdin);
//	freopen("data.out", "w", stdout);
	int T;
	cin>>T;
	while(T--){
		solve();
	}

	return 0;

}