#include <bits/stdc++.h>

#define debug(...) 42;
#ifdef LOCAL
#include "debug.h"
#endif

using namespace std;
#define fi first
#define se second
#define pb push_back
#define ll long long
#define pii pair<int, int>
#define all(a) a.begin(), a.end()
#define rep(i, a, b) for(int i = a; i < b; ++i)
#define per(i, a, b) for(int i = a - 1; i >= b; --i)
template<typename T> bool setmin(T &a, T b) { return (a > b ? a = b, 1 : 0); }
template<typename T> bool setmax(T &a, T b) { return (a < b ? a = b, 1 : 0); }

#define vi vector<int>
#define vl vector<ll>
#define trav(it, a) for(auto& it: a)

void solve(){
    int n; cin >> n;
    vi a(n); trav(ai, a) cin >> ai;
    int tot = count(all(a), 0);
    auto ck = [&](int cnt)->pair<bool, pii>{
        auto b = a;
        int up = 1, down = 1;
        cnt = tot - cnt;
        rep(i,0,n){
            if(a[i] == 0){
                a[i] = (cnt ? 1 : -1);
                cnt -= 1;
            }
            if(a[i] == 1){
                up += 1;
                down += 1;
            }else{
                assert(a[i] == -1);
                down -= 1;
            }
            if(down <= 0){
                a = b;
                return{false, {-1, -1}};
            }
        }
        a = b;
        int g = gcd(up, down);
        return {true, {up / g, down / g}};
    };
    int lo = 0, hi = tot;
    while(lo < hi){
        int mid = (lo + hi + 1) >> 1;
        if(ck(mid).fi) lo = mid;
        else hi = mid-1;
    }
    auto res = ck(lo);
    if(res.fi){
        cout << res.se.fi << ' ' << res.se.se << '\n';
    }else{
        cout << -1 << '\n';
    }
}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);

    int T; cin >> T;
    while(T--) solve();
    
    return 0;
}