#include <set>
#include <map>
#include <list>
#include <queue>
#include <cmath>
#include <time.h>
#include <random>
#include <bitset>
#include <vector>
#include <cstdio>
#include <stdio.h>
#include <assert.h>
#include <stdlib.h>
#include <memory.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <unordered_map>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

#define mk make_pair
#define fi first
#define se second

inline int read(){
	int t = 0,f = 1;
	register char c = getchar();
	while (c < 48 || c > 57) f = (c == '-') ? (-1) : (f),c = getchar();
	while (c >= 48 && c <= 57) t = (t << 1) + (t << 3) + (c ^ 48),c = getchar();
	return f * t;
}

const int N = 1e6 + 10;
int T,n,a[N],s[N],cnt[N],res[N];

void solve(){
	n = read();
	for (int i = 1;i <= n;i++) a[i] = read();
	int c1 = 0;
	for (int i = 1;i <= n;i++){
		s[i] = s[i - 1] + a[i],cnt[i] = cnt[i - 1] + (a[i] == 0);
		if (a[i] == 1) ++c1;
	}
	for (int i = 0;i <= n;i++) res[i] = 0x3f3f3f3f;
	int mn = 0;
	for (int i = n;i >= 0;i--){
		if (s[i] + cnt[i] >= -(mn - cnt[n] + cnt[i])) res[i] = cnt[i];
		mn = min(mn,s[i]);
	}
	int ss = 0,ans = res[0];
	for (int i = 1;i <= n;i++){
		ss += a[i];
		if (a[i] == 0) ++ss;
		if (ss < 0) break;
		ans = min(ans,res[i]);
	}
	if (ans == 0x3f3f3f3f) {puts("-1");return ;}
	int t = s[n] + ans - (cnt[n] - ans) + 1;
	ans = ans + c1 + 1;
	int d = __gcd(ans,t);
	t /= d,ans /= d;
	printf("%d %d\n",ans,t);
}

int main(){
#ifndef ONLINE_JUDGE
	freopen("in.in","r",stdin);
	// freopen("out.out","w",stdout);
#endif
	T = read();
	while (T--) solve();
	return 0;
}