#include<iostream>
#include<algorithm>
#include<vector>
#include<set>
#include<queue>
#include<map>
#include<math.h>
#include <functional>
#include<list>
#include<string>
#include<bitset>
#include<stack>
#include<cstring>
#include<stdio.h>

#define int long long
#define endl '\n'
#define mod 998244353
#define ffor(n) for(int i = 0;i < n;++i)


const int N = 2000006; 

using namespace std;

void build_log();
int mv_x[4] = {1,0,-1,0};
int mv_y[4] = {0,1,0,-1};
int t;
int m_log2[500005]; // log2(x) + 1
int k;
int n,m;
int h;

int ss;
int tt;




signed main()
{
    //ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
    cin>>t;
    while(t--)
    {
        cin>>n;
        int a = 0;
        int b = 0;
        int c = 0;
        double sum = 1;
        double pos = 1;
        double x;
        int ff = 0;
        ffor(n)
        {
            cin>>x;
            if(x == 1)
            {
                sum++;
                pos++;
            }
            else if(x == -1)
            {
                if(sum - 1 <= 0)
                {
                    if(c > 0)
                    {
                        c--;
                        sum++;
                        pos++;
                    }
                }
                sum--;
                if(sum <= 0)
                {
                    ff = 1;
                }
            }
            else
            {
                c++;
            }
        }
        if(ff)
        {
            cout<<-1<<endl;
        }
        else
        {
            if(sum > c)
            {
                sum -= c;
            }
            else
            {
                c -= sum - 1;
                sum = 1;
                if(c % 2 == 0)
                {
                    pos += c / 2;
                }
                else
                {
                    pos += c / 2 + 1;
                    sum += 1;
                }
            }

            int xpos = pos;
            int xsum = sum;
            int kt = __gcd(xpos,xsum);
            cout<<xpos/kt<<' '<<xsum/kt<<endl;
        }


        



    }




    return 0;
}





void build_log()
{
    for(int i = 1;i <= n;i++)
    {
        m_log2[i] = m_log2[i-1] + ((1 << m_log2[i-1]) == i);
    }
}