#include <bits/stdc++.h>
#define LL long long
typedef long long ll;
using namespace std;
const ll mn = 1000005;
ll a[mn];
ll n;
bool check(ll x){
    ll sum = 1;
    ll cnt = 0;
    for(ll i=1;i<=n;i++){
            if(a[i] == 0 && cnt<x){
                  sum++;
                  cnt++;
            }
            else if(a[i]==0 && cnt>=x){

                //cout << x << " " << i << " " << cnt << " " << sum << "\n";
                if (sum <= 1)
                    return 0;
                sum--;
            }
            else
            {
                if (a[i] < 0 && sum <= 1)
                    return 0;
                sum+=a[i];
            }
    }
    return 1;
}
ll pre0[mn],pre1[mn],pre2[mn];
void solve()
{
    pre0[0] = pre1[0] = pre2[0] = 0;
    cin>>n;
    for(ll i=1;i<=n;i++){
        cin>>a[i];
        pre1[i]=pre1[i-1]+(a[i]==1);
        pre0[i]=pre0[i-1]+(a[i]==0);
        pre2[i]=pre2[i-1]+(a[i]==-1);
    }
    for(ll i=1;i<=n;i++){
        if(pre2[i]>=pre1[i]+pre0[i]+1){
            cout<<-1<<'\n';
            return;
        }
    }
    ll l=0,r=n+10;
    ll ans = 0;
    while(l<=r){
        ll mid=l+r>>1;
        if(check(mid)){
            ans = mid ;
            r = mid - 1;
        }
        else
            l = mid + 1;
    }

    ll up = 1 + pre1[n] + ans, dw = 1 + pre1[n] - pre2[n] + ans - (pre0[n] - ans);
    ll gcd = __gcd(up, dw);

    cout<< up / gcd << " " << dw / gcd <<'\n';
}

int main()
{
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    int tt = 1;
    cin >> tt;
    while (tt--)
        solve();
}