#include <bits/stdc++.h>
using namespace std;

using LL =long long;
#define int LL
const int N=3e5+10;
const int M=N*2;

int n,m;
int sa[N];
void solve() {
    cin>>n;
    int atk=1,num=1;
    for(int i=1;i<=n;i++)cin>>sa[i];

    int cnt_1=0,cnt_f1=0;
    int sign=1;
    for(int i=1;i<=n;i++) {
        if(sa[i]==1)atk++,num++;
        else if(sa[i]==-1) {
            if(num>1) {
                num--;
            }
            else {
                if(cnt_f1) {
                    cnt_f1--;
                    num++;
                    atk++;
                }
                else {
                    sign=0;
                }
            }
        }
        else if(sa[i]==0) {
            if(num>1) {
                cnt_f1++;
                num--;
            }
            else {
                cnt_1++;
                num++;
                atk++;
            }
        }
    }
    if(!sign) {
        cout<<"-1"<<"\n";
        return;
    }
    //cerr<<"atk="<<atk<<" num="<<num<<"\n";
    int g=__gcd(atk,num);
    cout<<atk/g<<" "<<num/g<<"\n";
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int T=1;
    cin>>T;
    while(T--)solve();
    return 0;
}