#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace __gnu_pbds;
using namespace std;
#define pb push_back
#define rep(i,x,y) for(register int i=x;i<=y;i++)
#define rep1(i,x,y) for(register int i=x;i>=y;--i)
#define fire signed
#define il inline
template<class T> il void print(T x) {
	if(x<0) printf("-"),x=-x;
	if (x > 9) print(x / 10);
	putchar(x % 10 + '0');
}
const int bufsize = 230005;
char buf[bufsize], *f1, *f2;
#define getchar() (f1 == f2 && (f2 = buf + fread(f1 = buf, 1, bufsize, stdin)) == buf? EOF: *f1++)
template<class T> il void in(T &x) {
    x = 0; char ch = getchar();
    int f = 1;
    while (ch < '0' || ch > '9') {if(ch=='-') f = -1; ch = getchar(); }
    while (ch >= '0' && ch <= '9') { x = (x << 3) + (x << 1) + (ch ^ 48); ch = getchar(); }
    x *= f;
}
int T;
int n;
const int N=1e7+10;
int b[N],now[N],a[N];
void solve() {
	int x=1,y=1,cnt0=0,cnt1=1,cnt2=0;
	in(n);
	int f=0;
	rep(i,1,n) {
		int opt;
		in(opt);
		if(f) continue;
		if(opt==1) {
			x++,y++;
		}else if(opt==-1) {
			if(y<=1) {
				if(!cnt0) {
					puts("-1");
					f=1;
				}
				cnt0--;
				y++;
				y++;
				x++;
			}
			y--;
		}else {
			if(y<=1) {
				x++,y++;
//				cnt0++;
			}else {
				y--;
				cnt0++;
			}
		}
	}
	if(f) return;
	int yue=__gcd(x,y);
	printf("%lld %lld\n",x/yue,y/yue);
}
fire main() {
	in(T);
	while(T--) {
		solve();
	}
	return false;
}