#include<bits/stdc++.h>
#define ios ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
using namespace std;using ll = long long;using PLL = pair<ll,ll>;
const ll MAX = 1e18;const ll MIN = -1e18;const ll INF=0x3f3f3f3f;
const ll Q = 2e5+9;const ll MOD = 1e9 + 7;
ll a[Q];
void solve(){
   ll n;cin>>n;
   deque<ll> ans;
   ans.push_back(1);
   for (ll i = 1; i <= n; i++)
        cin>>a[i];
   ll now=0;
   for (ll i = 1; i <= n; i++)
   {
        if(a[i]==0) now++;
        if(a[i]==1) ans.push_back(1);
        if(a[i]==-1){
            if(ans.size()>=2){
                ans[0]+=1;
                ans.pop_back();
            }else{
                if(now>0){
                    now--;
                    ans[0]+=1;
                }else{
                    cout<<-1<<"\n";
                    return;
                }
            }
        }
   }
   while(now>0){
    if(ans.size()>=2){
        ans[0]+=1;
        ans.pop_back();
    }else{
        ans.push_back(1);
    }
    now--;
   }
   ll sum=0;
   for (ll i = 0; i < ans.size(); i++)
   {
        sum+=ans[i];
   }
   cout<<sum/gcd(sum,ans.size())<<" "<<ans.size()/gcd(sum,ans.size())<<"\n";
    
}
int main(){
    ios;ll _=1;cin>>_;
    while (_--)solve();
    return 0;
}