#include <bits/stdc++.h>
using namespace std;

void solve() {
	int n;
	cin >> n;
	vector<int> a(n + 1),b(n+1);
	int cnt1 = 0, cnt0 = 0;
	for(int i = 1; i <= n; i ++) {
		cin >> a[i];
		b[i]=a[i];
		if(a[i]==0){
			b[i]=1;
		}
	}
	vector<int> pre(n+1);
	pre[0]=1;
	int ans=1,cnt=1,cha=1;
	for(int i = 1; i <= n; i++){
		if(b[i]==1){
			ans++,cnt++;
			cha++;
		}
		else{
			cha--;
			cnt--;
		}
		pre[i] = pre[i-1]+b[i];
		if(cnt<=0){
			cout<<"-1\n";
			return ;
		}
	}
	for(int i=n;i;--i){
		if(a[i]==0&&cha>2&&pre[i-1]>1){
			b[i] = -1;
			cha-=2;
		}
	}
	ans=1,cnt=1;
	for(int i=1;i<=n;++i){
		if(b[i]==1){
			ans++;cnt++;
		}
		else{
			cnt--;
		}
	}
	int tmp = __gcd(ans, cnt);
	ans /= tmp, cnt /= tmp;
	cout << ans << " " << cnt << "\n";
}

int main() {
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	int t;
	cin >> t;
	while(t --) {
		solve();
	}
	
}