#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
template <typename T> inline void read(T &F) {
    int R = 1; F = 0; char CH = getchar();
    for(; !isdigit(CH); CH = getchar()) if(CH == '-') R = -1;
    for(; isdigit(CH); CH = getchar()) F = F * 10 + CH - 48;
    F *= R;
}
inline void file(string str) {
    freopen((str + ".in").c_str(), "r", stdin);
    freopen((str + ".out").c_str(), "w", stdout);
}
const int N = 1e6 + 10;
int n, ai[N];
bool check(int x) {
    int cnt = 1, val = 1;
    for(int i = 1; i <= n; i++) {
        if(ai[i] == -1) {
            if(cnt <= 1) return false;
            cnt--;
        }
        else if(ai[i] == 1) cnt++, val++;
        else {
            if(x) cnt++, val++, x--;
            else {
                if(cnt <= 1) return false;
                cnt--;
            }
        }
    }
    return true;
}
int gcd(int x, int y) {
    return y ? gcd(y, x % y) : x;
}
int main() {
    //file("");
    int T; read(T);
    while(T--) {
        read(n);
        for(int i = 1; i <= n; i++) read(ai[i]);
        int l = 0, r = n, res = INT_MAX;
        while(l <= r) {
            int mid = (l + r) >> 1;
            if(check(mid)) res = mid, r = mid - 1;
            else l = mid + 1;
        }
        if(res == INT_MAX) puts("-1");
        else {
            int cnt = 1, val = 1, x = res;
            for(int i = 1; i <= n; i++) {
                if(ai[i] == -1) cnt--;
                else if(ai[i] == 1) cnt++, val++;
                else {
                    if(x) cnt++, val++, x--;
                    else cnt--;
                }
            }
            const int g = gcd(cnt, val);
            cout << val / g << ' '<< cnt / g << '\n';
        }
    }
    
    #ifdef _MagicDuck
        fprintf(stderr, "# Time: %.3lf s", (double)clock() / CLOCKS_PER_SEC);
    #endif
    return 0;
}