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

#define ios ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define int long long
#define pb push_back
#define ff first
#define ss second
typedef pair<int, int> PII;
const int N = 300007;
const int inf = 1e18;
const int mod = 1e9+7;

mt19937_64 rng(time(0));

int a[N];
void solve() {
    int n;
    cin>>n;
    int cnt=1;
    priority_queue<PII,vector<PII>,greater<PII>>qu;
    int tmp=0;
    for(int i=1;i<=n;i++)
    {
        cin>>a[i];
        if(a[i]==1||a[i]==0)cnt++;
        else{
            cnt--;
            qu.push({cnt,i});
        }
        if(cnt<=0)tmp=1;
    }
    if(tmp==1)
    {
        cout<<-1<<'\n';
        return ;
    }
    int p=1,q=1,nu=0;
    for(int i=1;i<=n;i++)
    {
        if(a[i]==1)
        {
            p++;
            q++;
        }
        else if(a[i]==-1)q--;
        else
        {
            while(qu.size()&&qu.top().ss<i)qu.pop();
            if(qu.size())
            {
                int t=qu.top().ff;
                if(t-(nu+1)*2<=0)
                {
                    q++;
                    p++;
                }
                else
                {
                    q--;
                    nu++;
                }
            }
            else
            {
                if(q==1)
                {
                    p++;
                    q++;
                }
                else q--;
            }
        }
    }
    int g=__gcd(p,q);
    p/=g;
    q/=g;
    cout<<p<<' '<<q<<'\n';
}
signed main() {
    ios;
    int _ = 1;
    cin >> _;
    while (_--) {
        solve();
    }
    return 0;
}