#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define sz(a) ((int)a.size())
#define all(a) a.begin(), a.end()
#define rep(i, l, r) for (int i = l; i < r; ++i)
#define per(i, r, l) for (int i = r-1; i >= l; --i)
typedef long long ll;
typedef pair<int, int> PI;
template<typename T> bool setmax(T &a, T b) { return (a < b ? a = b, 1 : 0); }
template<typename T> bool setmin(T &a, T b) { return (a > b ? a = b, 1 : 0); }

#define print(a) cerr << "[ "; for (auto it : a) cerr << it << ", "; cerr << "]\n";

void solve() {
    int n; cin >> n;
    vector<int> a(n + 1);
    for (int i = 1; i <= n; i++) cin >> a[i];
    vector<int> cur{1};
    int cnt = 0;
    for (int i = 1; i <= n; i++) {
        if (a[i] == 1) {
            cur.push_back(1);
        } else if (a[i] == -1) {
            if (sz(cur) < 2) {
                cout << -1 << '\n';
                return;
            }
            cur[0] += cur.back();
            cur.pop_back();
        } else {
            ++cnt;
            cur.push_back(1);
        }
    }
    int up = accumulate(all(cur), 0);
    int down = sz(cur);
    // cerr << "??? " << up << ' ' << down << '\n';
    // print(cur);
    while (cnt && down - 2 >= 1) {
        --cnt;
        down -= 2;
        --up;
    }
    cout << (up / gcd(up, down)) << ' ' << (down / gcd(up, down)) << '\n';
}
int main() {
    ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
    int tt; cin >> tt;
    while (tt--) solve();

    return 0;
}