#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();
	int res = 1, att = 1, spare = 0;
	irep(i,0,n-1){
		int op = read();
		if(op == 1)res ++, att ++;
		if(op == -1){
			if(res >= 2)-- res;
			else {
				if(spare == 0){
//					puts("-1");
					flag = 1;	
				}
				else {
					-- spare;
					++ att;
				}
			}
		}
		if(op == 0)++ spare;
	
	}
	if(flag == 1)puts("-1");
	if(flag == 1)return;
	while(spare){
		if(res >= 2){
			-- res;
		}
		else ++ res, ++ att;
		--spare;
	}
	int gcd = __gcd(att, res);
	printf("%d %d\n",att / gcd, res / gcd);
}

int main(){
	int T = read();
	while(T --){
		solve();
	}
	return 0;
}