/*If we keep holding onto yesterday, what are we going to be tomorrow?*/


#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define int long long int 
bool debugg = false;
#define dbg if(debugg)
#define F first 
#define S second 
template <typename T>
using order_set = tree<T, null_type,less<T>, rb_tree_tag,tree_order_statistics_node_update>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());  


void solve()
{
    int n;
    cin >> n;

    int cnt = 0;

    vector<int>v(n);
    for(int i = 0 ; i < n ; i ++) cin >> v[i];

    int cur = 1 , sum = 1;
    for(int i = 0 ; i < n ; i ++){
        if(v[i] == 1){
            cur ++ , sum ++;
           
            continue;
        }

        if(v[i] == -1){
            if(cur == 1 && cnt == 0){
                cout << -1 << '\n';
                return;
            }

            if(cnt > 0){
                cnt --;
                sum ++;
            }
            else{
                cur --;
            }
            continue;
        }

        else if(v[i] == 0 ) cnt ++;

        
    }
    //cout << "____\n\n";
    while(cnt > 0){
        //cout << cur << ' ' << sum << '\n';
        if(cur > 1){
            cur --;
        }
        else{
            cur ++;
            sum ++;
        }
        cnt --;
    }

    cout << sum / __gcd(sum , cur) << ' ' << cur / __gcd(sum , cur)<< '\n';
}



int32_t main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
        
    int t  = 1;
    cin >> t;
    
    while(t--){
        solve();
    }

    return 0;

}