#include<bits/stdc++.h>
#define irep(i,l,r) for(int i = l; i <= r; ++i)
#define drep(i,r,l) for(int i = r; i >= l; --i)
#define ceil(pp,qq) (((pp)>0)^((qq)>0)?-Abs(pp)/Abs(qq):(pp)%(qq)?(pp)/(qq)+1:(pp)/(qq))
#define floor(pp,qq) (((pp)>0)^((qq)>0)?-ceil(Abs(pp),Abs(qq)):(pp)/(qq))
#define ll long long
#define LL __int128
using namespace std;
ll Abs(ll x){return x > 0 ? x : - x;}
inline ll read(){
	char ch = getchar();
	ll s = 0; bool w = 0;
	while(!isdigit(ch)){if(ch == '-')w = 1;ch = getchar();}
	while(isdigit(ch))s = (s << 3) + (s << 1) + (ch ^ 48), ch = getchar();
	return w ? - s : s;
}

const int itinf = 1e9;
const ll llinf = 4e18;
const int mod = 1000000007;
const int N = 500009;

inline int mul(int nma, int nmb){
	return ((1ll * nma * nmb % mod) + mod) % mod;
}

void solve(){
	
	int flag = 0;
	int n = read();
	vector<int>a(n + 1);
	int l = 0,r = 1;
	a[0] = 0;
	irep(i,1,n){
		a[i] = read();
		if(a[i] == 0)++ r;


	}
	ll bcnt, bres;
	auto check = [&](int x) -> bool{
	//	cerr << x << ' ' << endl;
		int cnt = 0;
		int att = 0, res = 0;
		for(int op : a){
			if(op == 1)++ att, ++ res;
			if(op == -1){
				-- res;
				if(res <= 0)return false;
			}
			if(op == 0){
				if(cnt <= x){
					++ cnt;
					++ res, ++ att;
				}
				else{
					 -- res;
					 if(res == 0)return false;
				}
			}
		}

		bcnt = att, bres = res;
		return true;
	};
	if(check(r) == 0){
		puts("-1");
		return;
	}
	//irep(i,0,r)cerr << i << ' ' << check(i) << endl;;
//	cerr << endl;
	while(l < r){
		int mid = (l + r) >> 1;
		if(! check(mid))l = mid + 1;
		else r = mid;
	}
	ll gcd = __gcd(bcnt, bres);
	printf("%lld %lld\n",bcnt / gcd, bres / gcd);
}
/*
1 1
2 2
1 2
2 3
1 3
2 4
*/
int main(){
	int T = read();
	while(T --){
		solve();
	}
	return 0;
}