#include <bits/stdc++.h>
#define int long long
#define endl '\n'
#define IOS ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr)
using namespace std;
typedef pair<int, int> pii;
const int maxn = 1e6;
signed main()
{
    IOS;
    int t;
    cin >> t;
    while (t--)
    {
        int n;
        cin >> n;
        int fz = 1, fm = 1, f = 0;
        int ff = 1;
        vector<int> v(n + 1);
        for (int i = 0; i < n; i++)
        {
            cin >> v[i];
        }
        int f0 = -1;
        for (int i = n - 1; i >= 0; i--)
        {
            if (v[i] == 0)
            {
                f0 = i;
                break;
            }
        }
        int fz1 = 0, fm1 = 0;
        int mfm = 0;
        for (int i = f0 + 1; i < n; i++)
        {
            if (v[i] == 1)
            {
                fz1++;
                fm1++;
            }
            else if (v[i] == -1)
            {
                fm1--;
            }
            mfm = min(mfm, fm1);
        }
        mfm *= -1;
        mfm = max(mfm, 0ll);
        for (int i = 0; i <= f0; i++)
        {
            if (!ff)
                continue;
            if (v[i] == 1)
            {
                fz++;
                fm++;
            }
            else if (v[i] == 0)
            {
                f++;
            }
            else if (v[i] == -1)
            {
                if (fm > 1)
                {
                    fm--;
                }
                else
                {
                    if (f > 0)
                    {
                        f--;
                        fz++;
                    }
                    else
                    {
                        ff = 0;
                    }
                }
            }
        }
        if (!ff)
        {
            cout << "-1\n";
        }
        else
        {
            if (f > 0 && fm > mfm + 1)
            {
                int x = min(fm - mfm - 1, f);
                fm -= x;
                f -= x;
            }
            else if (f > 0 && fm < mfm + 1)
            {
                int x = min(mfm + 1 - fm, f);
                fz += x;
                fm += x;
                f -= x;
            }
            if (f > 0)
            {
                int x = (f + 1) / 2;
                fz += x;
                fm += f % 2;
            }

            fz += fz1;
            fm += fm1;
            if (fm < 1)
            {
                cout << "-1\n";
            }
            else
            {
                int _ = gcd(fz, fm);
                cout << fz / _ << " " << fm / _ << endl;
            }
        }
    }
}