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

void solve() {
    int n;
    cin >> n;
    vector<int> a(n);
    vector<int> f(n);
    for(int i = 0; i < n; i++) {
        cin >> a[i];
    }

    vector<int> s;
    queue<int> que0;
    int p = 1,q = 1;
    for(int i = 0; i < n; i++) {
        if(a[i] == 1)
            s.push_back(i);
        else if(a[i] == 0)
            que0.push(i);
        else if(a[i] == -1) {
            if(s.size()) {
                s.pop_back();
                p += 1;
            }
            else if(que0.size()){
                que0.pop();
                p += 1;
            }
            else {
                cout << "-1\n";
                return;
            }
        }
    }

    int v = 0;

    for(int i = 0; i < s.size(); i++) {
        if(que0.size()) {
            while(!que0.empty() && que0.front() < s[i]) {
                v++;
                que0.pop();
            }
            if(!que0.empty() && s[i] < que0.front()) {
                p += 1;
                que0.pop();
            }
            else {
                q+=1;p+=1;
            }
        }
        else {
            q+=1;p+=1;
        }
    }
    v += que0.size();

    p += v / 2;
    p += v % 2;
    q += v % 2;
    cout << p / __gcd(p,q) << ' ' << q / (__gcd(p,q)) << '\n';
}


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

    int t = 1;
    cin >> t;

    while(t--) solve();


    return 0;
}