//
// Created by travel on 2024/10/9.
//
#include<bits/stdc++.h>
using namespace std;

#define int long long
#define endl '\n'

int a[1000009];
int n;
int back[1000009];
void solve()
{
    int p = 1, q = 1, c = 0, t;
    cin >> n;
    for (int i = 1; i <= n; i++)
        cin >> a[i];
    for(int i = 1;i <= n+1;i++) back[i] = 0;
    for (int i = n; i >= 1; i--)
        back[i] = min(a[i],back[i - 1] + a[i]);
//    for(int i = 1;i <= n;i++)
//        cout<<back[i]<<endl;
    bool flag = 0;
    for(int i = 1;i <= n;i++){
        if(a[i] == 1)
            p++,q++;
        else if(a[i] == -1){
            if(q > 1)
                q--;
            else {
                flag = 1;
                break;
            }
        }
        else{
            if(q + back[i + 1] > 1){
                if(q > 1)
                    q--;
                else p++,q++;
            }
            else q++,p++;
        }
    }
    if(flag) cout<<-1<<endl;
    else cout << p/__gcd(p,q) <<' '<< q/__gcd(p,q) <<'\n';
}

signed main()
{
    int turns;
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin >> turns;
    while (turns--)
        solve();
    return 0;
}