#include<bits/stdc++.h>
using namespace std;
constexpr int M=1e6+5;
int n,cur,l,r,ans,A,B,g,a[M],b[M];
int read(){
	int x=0,f=1;char ch=getchar();
	while (!isdigit(ch)) {if (ch=='-') f=-1;ch=getchar();}
	while (isdigit(ch)) x=x*10+ch-48,ch=getchar();
	return x*f;
}
bool check(int mid){
	for (int i=1;i<=n;i++) b[i]=a[i];
	for (int i=1;i<=n;i++)
		if (!a[i]&&mid) b[i]=1,mid--;
		else if (!a[i]) b[i]=-1;
	int B=1;
	for (int i=1;i<=n;i++){
		if (b[i]==1) B++;
		else B--;
		if (!B) return 0;
	}
	return 1;
}
void solve(){ n=read();cur=0;
	for (int i=1;i<=n;i++) a[i]=read(),cur+=!a[i];
	l=0;r=cur; ans=-1;
	while (l<=r){
		int mid=l+r>>1;
		if (check(mid)) ans=mid,r=mid-1;
		else l=mid+1;
	}
	if (ans<0) return puts("-1"),void();
	for (int i=1;i<=n;i++)
		if (!a[i]&&ans)
			a[i]=1,ans--;
		else if (!a[i]) a[i]=-1;
	A=B=1;
	for (int i=1;i<=n;i++)
		if (a[i]==1) A++,B++;
		else B--;
	g=__gcd(A,B);
	printf("%d %d\n",A/g,B/g);
}
int main(){int T=read();
	while (T--) solve();
	return 0;
}