#include<bits/stdc++.h>

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

pii Max(pii a, pii b) {
    if (a.first * b.second > b.first * a.second)return a;
    else return b;
}

void solve() {
    int n;
    cin >> n;
    vector<int> v(n + 1, 0);
    for (int i = 1; i <= n; ++i) cin >> v[i];
    int sum = 1, cnt = 1, zero = 0;
    for (int i = 1; i <= n; ++i) {
        if (v[i] == 1)++sum, ++cnt;
        else if (v[i] == 0)++zero;
        else {
            if (cnt == 1) {
                if (zero)--zero, ++sum;//1.
                else {
                    cout << -1 << endl;
                    return;
                }
            } else --cnt;
        }
    }
    pii res = {1, inf};
    for (int i = 0; i <= zero; ++i) {
        if (cnt + 2 * i - zero > 0) {
            pii tmp = {sum + i, cnt - zero + 2 * i};
            int G = __gcd(tmp.first, tmp.second);
            tmp.first /= G, tmp.second /= G;
            res = Max(res, tmp);
        }
    }
    int g = __gcd(res.first, res.second);
    res.first /= g, res.second /= g;
    if (res.second != inf)cout << res.first << ' ' << res.second << endl;
    else {
        while (true) {

        }
    }
}

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

    return 0;
}