#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> PII;
#define pb push_back

void solve(){
    int n; cin>>n;
    vector<int> a(n);
    vector<int> pos;
    for (int i=0;i<n;i++){
        cin>>a[i];
        if (a[i]==0){
            pos.pb(i);
            a[i]=1;
        }
    }
    vector<int> pre(n);
    for (int i=0;i<n;i++){
        if (i==0) pre[i]=a[i];
        else pre[i]=a[i]+pre[i-1];
    }
    int tmp=1;
    for (int i=0;i<n;i++){
        tmp+=a[i];
        if (tmp<=0){
            cout<<-1<<"\n";
            return;
        }
    }
    int cur=count(a.begin(),a.end(),1)+1-count(a.begin(),a.end(),-1);
    int j=0;
    int mo=cur,so=count(a.begin(),a.end(),1)+1;
    while (mo>2&&j<pos.size()){
        mo-=2;
        so--;
        if (pre[pos[pos.size()-j-1]]<=1){
            j++;
            mo+=2,so++;
            continue;
        }
        j++;
    }
    cout<<so/__gcd(so,mo)<<" "<<mo/__gcd(so,mo)<<"\n";
}

int main(){
    ios::sync_with_stdio(0); cin.tie(0);
    int t; cin>>t;
    while (t--) solve();
    return 0;
}