#include<bits/stdc++.h>

using namespace std;
#define int long long
#define endl '\n'
typedef pair<int, int> pii;
const int inf = 1e18;
const int N = 2e5 + 5;

void solve() {
    int n;
    cin >> n;
    vector<int> v(n + 1, 0);
    for (int i = 1; i <= n; ++i) cin >> v[i];
    int cnt1 = 0, cnt0 = 0, fs = 0;
    for (int i = 1; i <= n; ++i) {
        if (v[i] == 1)++cnt1;
        else if (v[i] == 0)++cnt0;
        else {
            ++fs;
            if (cnt1 >= fs)continue;
            else if (cnt1 + cnt0 >= fs) {
                int tmp = fs - cnt1;
                cnt0 -= tmp, cnt1 += tmp;
            } else {
                cout << -1 << endl;
                return;
            }
        }
    }
    pii res = {1 + cnt1 + cnt0, 1 + cnt1 - fs - cnt0 + 2 * cnt0};
    auto Max = [&](pii a, pii b) -> pii {
        if (a.first * b.second > b.first * a.second)return a;
        else return b;
    };
    for (int i = 0; i <= cnt0; ++i) {
        if (cnt1 + 2 * i >= fs + cnt0) {
            pii tmp = {1 + cnt1 + i, 1 + cnt1 - fs - cnt0 + 2 * i};
            res = Max(res, tmp);
        }
    }
    int g = gcd(res.first, res.second);
    cout << res.first / g << ' ' << res.second / g << endl;
}

signed main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int _ = 1;
    cin >> _;
    while (_--) {
        solve();
    }

    return 0;
}