#include <bits/stdc++.h>

using namespace std;

#define ll long long

#define double long double

void solve(){
    int n;cin >> n;
    vector<int> a(n + 1),pos(n + 1),neg(n + 1),zero(n + 1);
    int x = 0,y = 0;
    for (int i = 1;i <= n;i++){
        cin >> a[i];
        pos[i] = pos[i - 1] + (a[i] == 1);
        neg[i] = neg[i - 1] + (a[i] == -1);
        zero[i] = zero[i - 1] + (a[i] == 0);
    }
    int p = -1,q = 100;
    double r = -1;
    bool ok = false;
    int jue = 0;
    for (int i = 1;i <= n;i++){
        int t = pos[n] + zero[i] + 1;
        int bw = t - (neg[n] - neg[i] + zero[n] - zero[i]);
        //if (bw <= 0) continue;
        //cout << t << " " << bw << endl;

        jue += a[i];
        //continue;
        if (jue < 0){
            break;
        }
        if (bw == 0) continue;
        double xx = 1.0 * t / (bw);
        if (xx > r){
            r = xx;
            int tt = gcd(t,bw);
            t /= tt;
            bw /= tt;
            p = t,q = bw;
        }
    }
    if (r == -1){
        cout << -1 << endl;
    }else{
        cout << p << " " << q << endl;
    }
}

signed main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int T;cin >> T;
    while (T--){
        solve();
    }

    return 0;
}