#include <bits/stdc++.h>
using namespace std;
inline int gcd(int x, int y) { return y ? gcd(y, x % y) : x; }

inline int lcm(int n, int m) { return n * m / gcd(n, m); }
int a,t,n;
int main(){
    scanf("%d",&t);
    while(t--) {
        scanf("%d", &n);
        int x = 1, y = 1, flag = 0, ccnt = 0;
        for (int i = 0; i < n; i++) {
            scanf("%d", &a);
            if (a == 1) {
                x++;
                y++;
            }
            if (a == -1) {
                if (y > 1) {
                    y--;
                } else {
                    if (ccnt) {
                        x++;
                        ccnt--;
                    } else {
                        flag = 1;
                    }
                }
            }
            if (a == 0) {
                ccnt++;
            }
            //printf("%d  %d\n",x,y);
        }
        if (flag) {
            puts("-1");
            continue;
        }
        while (ccnt--) {
            if (y > 1) {
                y--;
            } else {
                x++;
                y++;
            }
        }
        int tmp = gcd(x, y);
        printf("%d %d\n", x / tmp, y / tmp);
    }
}