#include<bits/stdc++.h>
#define inf 0x3f3f3f3f3f3f3f3fll
#define debug(x) cerr<<#x<<"="<<x<<endl
using namespace std;
using ll=long long;
using ld=long double;
using pli=pair<ll,int>;
using pi=pair<int,int>;
template<typename A>
using vc=vector<A>;
inline int read()
{
    int s=0,w=1;char ch;
    while((ch=getchar())>'9'||ch<'0') if(ch=='-') w=-1;
    while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
    return s*w;
}
inline ll lread()
{
    ll s=0,w=1;char ch;
    while((ch=getchar())>'9'||ch<'0') if(ch=='-') w=-1;
    while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
    return s*w;
}
int sum[1000002];
int mi[1000002];
int a[1000001];
int n;
int main()
{
    int T=read();
    while(T--)
    {
        n=read(),mi[n+1]=sum[n+1]=0;
        for(int i=1;i<=n;i++) a[i]=read();
        for(int i=n;i;i--)
        {
            int v=a[i]?a[i]:-1;
            mi[i]=v+min(0,mi[i+1]);
            sum[i]=sum[i+1]+(a[i]==1);
        }

        int A=0,B=1,nc=1,ns=1;
        for(int i=1;i<=n;i++)
        {
            if(a[i]>=0) ns++,nc++;
            else
            {
                nc--;
                if(!nc) break;
            }
            if(nc+mi[i+1]<=0) continue;
            int a=ns+sum[i+1],b=nc+sum[i+1]-(n-i-sum[i+1]);
            // printf("i=%d : %d %d  %d %d  %d %d\n",i,nc,ns,sum[i+1],mi[i+1],a,b);
            if((ll)a*B>(ll)A*a) A=a,B=b; 
        }
        if(!A) printf("-1\n");
        else
        {
            int g=__gcd(A,B);
            printf("%d %d\n",A/g,B/g);
        }
    }
    return 0;
}