#include <bits/stdc++.h>
using namespace std;
using LL = long long;

void solve() {
    int n;
    cin >> n;
    vector<int> a(n + 1), suf(n + 2);
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
    }
    for (int i = n; i >= 1; i--) {
        suf[i] = suf[i + 1] + (a[i] == 0 ? -1 : a[i]);
    }

    int power = 1, now = 1;
    for (int i = 1; i <= n; i++) {
        if (a[i] == 1) {
            now++;
            power++;
        } else if (a[i] == -1) {
            now--;
        } else {
            if (now + suf[i + 1] <= 1) {
                now++;
                power++;
            } else {
                now--;
            }
        }
        if (now <= 0) {
            cout << -1 << "\n";
            return;
        }
    }
    int g = gcd(now, power);
    power /= g;
    now /= g;
    cout << power << " " << now << "\n";
}

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

    int t = 1;
    cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}