#include<bits/stdc++.h>
using namespace std;
int c1[1000006],c2[1000005],a[1000005],cs[1000006];
int main()
{
    int t,n;
    scanf("%d",&t);
    while(t--){
        scanf("%d",&n);
        for(int i=1;i<=n;i++)
        {
            scanf("%d",&a[i]);
            c1[i]=c2[i]=0,cs[i]=0;
        }
        c1[n+1]=c2[n+1]=0;
        for(int i=n;i>0;i--)
        {
            if(a[i]==1)
            {
                c2[i]=c2[i+1];c1[i]=c1[i+1]+1;
            }
            else {
                    c2[i]=c2[i+1]+1;c1[i]=c1[i+1];
            }
        }
        int css=0;
        for(int i=n;i>0;i--)
        {
            if(a[i]==-1) css++;
            else if(a[i]==1) css--;
            else cs[i]=css;
        }
        int f=1;
        long long c=1,b=1;
        for(int i=1;i<=n;i++)
        {
            //cout<<c<<" "<<b<<" "<<c1[i]<<" "<<c2[i]<<endl;
            if(a[i]==1) c++,b++;
            else if(a[i]==-1)
            {
                if(b>=2) b--;
                else
                {
                    f=0;break;
                }
            }
            else
            {
                if(b+c1[i]>=c2[i]+1&&b>=2&&b>cs[i]) b--;
                else c++,b++;
            }
        }
        if(f)
        {
            long long g=__gcd(c,b);
            printf("%lld %lld\n",c/g,b/g);
        }
        else printf("-1\n");
    }


    return 0;
}