#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
constexpr int N = 5e5 + 5;
constexpr int M = 2e5 + 5;
constexpr int INF = 0x3f3f3f3f;
constexpr ll LNF = 0x3f3f3f3f3f3f3f3f;
constexpr int Mod = 1000000007;
constexpr ll Base = 131;
constexpr int MaXBIT = 30;
constexpr double eps = 1e-9;
ll power(ll a,ll b) {
    ll res=1;
    while(b) {
        if(b&1) res=res*a%Mod;
        a=a*a%Mod;
        b>>=1;
    }
    return res;
}
ll inv(ll x) {
    return power(x,Mod-2);
}
void solve()
{
    int n,cnt1=1,cnt2=0,cnt3=0;
    cin>>n;
    vector<int> a(n+1);
    for(int i=1;i<=n;i++)
        cin>>a[i];
    for(int i=1;i<=n;i++) {
        if(a[i]==1) {
            cnt1+=1;
        }
        else if(a[i]==-1) {
            cnt2+=1;
            if(cnt2>=cnt1+cnt3) {
                cout<<"-1\n";
                return;
            }
        }
        else {
            cnt3+=1;
        }
    }
    n+=1;
    int x=max(cnt1,n/2+1),y=2*x-n,g=gcd(x,y);
    x/=g,y/=g;
    cout<<x<<" "<<y<<"\n";
}
int main()
{
    ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
    cout<<fixed<<setprecision(2);
    int _=1;
    cin>>_;
    while(_--)
        solve();
    return 0;
}