#include<bits/stdc++.h>
#define rep(i,j,k) for(int i=j;i<=k;i++)
#define repp(i,j,k) for(int i=j;i>=k;i--)
#define ls(x) (x<<1)
#define rs(x) ((x<<1)|1)
#define mp make_pair
#define sec second
#define fir first
#define pii pair<int,int>
#define lowbit(i) i&-i
#define double long double
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int N=1e7+2,M=35,S=(1<<8)+5,inf=1e9+7,mo=998244353;
const double eps=1e-8;
void read(int &p){
	int x=0,w=1;
	char ch=0;
	while(!isdigit(ch)){
		if(ch=='-')w=-1;
		ch=getchar();
	}
	while(isdigit(ch)){
		x=(x<<1)+(x<<3)+ch-'0';
		ch=getchar();
	}
	p=x*w;
}
int T;
int n,a[N],lim[N],cnt[N];
void solve(){
    read(n);
    rep(i,1,n)
        read(a[i]),cnt[i]=cnt[i-1]+(a[i]==0),a[i]+=a[i-1];
    rep(i,1,n){
        int num=(i-1)/2+1,nwn=(a[i]+(i-cnt[i]))/2;
        if(cnt[i]+a[i]<0){
            puts("-1");
            return;
        }
        lim[i]=cnt[i]-max(0,num-nwn);
    }
    int ansp=0,ansn=0,lst=n;
    repp(i,n,1){
        lst=min(lst,lim[i]);
        if(cnt[i]==cnt[i-1]){
            if(a[i]>a[i-1])ansp++;
            else ansn++;
        }
        else{
            if(lst)ansn++,lst--;
            else ansp++;
        }
    }
    int gcdn=__gcd(ansp+1,ansp-ansn+1);
    printf("%d %d\n",(ansp+1)/gcdn,(ansp-ansn+1)/gcdn);
}
signed main(){
    read(T);
    while(T--)
        solve();
    return 0;
}