#include <bits/stdc++.h>

using namespace std;

#define int long long

void solve(){
    int n;cin >> n;
    vector<int> a(n + 1);
    for (int i = 1;i <= n;i++){
        cin >> a[i];
    }
    int cur = 1;
    int siz = 1;
    int zero = 0;
    for (int i = 1;i <= n;i++){
        cur += a[i] == 1;
        siz += a[i] == 1;
        siz -= a[i] == -1;
        zero += a[i] == 0;
        if (siz == 0){
            if (zero == 0){
                cout << -1 << endl;
                return;
            }else{
                zero--;
                cur++;
                siz++;
            }
        }
    }
    int r = -1;
    int p,q;
    for (int i = 0;i <= zero;i++){
        int cbin = zero - i;
        if (cbin >= siz + i){
            continue;
        }
        double rr = (double)1.0 * (cur + i) / (siz - cbin + i);
        if (r == -1 || (cur + i) * q > (siz - cbin + i) * p){
            r = rr;
            int d = gcd(cur + i,siz - cbin + i);
            int pp = (cur + i) / d;
            int qq = (siz - cbin + i) / d;
            p = pp,q = qq;
        }
    }
    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;
}