#include <bits/stdc++.h>
#define test(x) cout << #x <<" = " << x << endl
#define int long long
#define endl "\n"
using namespace std;
const int MAXN = 1e6 + 10;
int n;
int tot[3][MAXN], a[MAXN];

bool chk(int k){
    int cnt = 0;
    int sum = 1, now = 0;
    for(int i = 1; i <= n; ++i) {
        sum += a[i];
        if(a[i] == 0){
            ++cnt;
            if(cnt <= k)
                sum++;
            else
                sum--;
        }

        if(sum < 1) {
            return 0;
        }
    }
    return 1;
}

void sol(){
    cin >> n;
    int num[3]={0,0,0};
    for(int i = 1; i <= n; ++i){
        cin>>a[i];
        num[a[i]+1]++;
    }
    int l = 0, r = n + 1;
    while(l<r){
        int mid = (l+r)/2;
        if(chk(mid))
            r = mid;
        else
            l = mid + 1;
    }
    if(l > num[1]){
        cout<<"-1\n";
        return;
    }
    int x = num[2] + 1 + l, y = x - num[0] -(num[1] - l), d = __gcd(x, y);
    x/=d, y/= d;
    cout<<x <<" "<< y <<endl;
}

signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int T;
    cin >> T;
    while(T--) {
        sol();
    }
    return 0;
}
/*
6
7
1 1 1 -1 1 1 -1
4
1 0 -1 0
4
0 -1 -1 0
1
0
2
0 0
1 -1

1
6
1 1 1 0 0 0

4 1
*/