#pragma GCC optimize(3, "Ofast", "inline")

#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)

#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
using namespace std;
int n;
int gcd(int a, int b)
{
    if (b == 0)
    {
        return a;
    }
    return gcd(b, a % b);
}
void solve()
{
    cin >> n;
    int to = 1, dow = 1;
    int sum = 0;
    int flag = 1;
    for (int i = 0; i < n; i++)
    {
        int x;
        cin >> x;
        if (x == 1)
        {
            to += 1;
            dow += 1;
        }
        else if (x == -1)
        {
            dow -= 1;
            if (dow == 0)
            {
                dow = 1;
                if (sum == 0)
                {
                    cout << "-1" << "\n";
                    flag = 0;
                    // break;
                }
                sum--;
                to++;
            }
        }
        else
        {
            sum++;
        }
    }
    if (flag == 0)
    {
        return;
    }
    if (sum != 0)
    {
        if (dow > sum)
        {
            dow -= sum;
        }
        else
        {
            sum -= dow - 1;
            dow = 1;
            to += sum / 2;
            if (sum % 2 == 1)
            {
                to++;
                dow++;
            }
        }
    }
    int igcd = gcd(to, dow);
    cout << to / igcd << " " << dow / igcd << "\n";
}
int main()
{
    IOS;
    int t;
    cin >> t;
    while (t--)
    {
        solve();
    }
    return 0;
}