#include <bits/stdc++.h>

using namespace std;

void solve() {
    int n;
    cin >> n;
    vector<int> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i]; 
    }
    int can_choose = 0;
    long long sum = 1;
    long long cnt = 1;
    long long at_least = 1;
    for (int i = 0; i < n; i++) {
        if (a[i] == 1) {
            sum += 1;
            cnt += 1;
            at_least++;
        }
        if (a[i] == 0) {
            at_least = max(at_least - 1, 1LL);
            can_choose += 1;
        }
        if (a[i] == -1) {
            while (cnt < 2) {
                if (can_choose == 0) {
                    cout << "-1\n";
                    return;
                }
                can_choose -= 1;
                sum += 1;
                cnt += 1;
                at_least++;
            }
            cnt -= 1;
            at_least--;
        }
    }
    at_least = max(at_least, 1LL);
    while (can_choose--) {
        if (cnt > at_least) {
            cnt--;
        } else {
            sum += 1;
            cnt += 1;
        }
    } 
    long long x = gcd(sum, cnt);
    sum /= x;
    cnt /= x;
    cout << sum << " " << cnt << "\n";
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int t;
    cin >> t;
    while (t--) {
        solve();
    }
}