#include <iostream>
#include <cstdio>
using namespace std;

int t,n;
int a[1000010];
int s[1000010],minn[1000010];

int gcd(int x,int y)
{
	while (x ^= y ^= x ^= y %= x);
	return y;
}

int main()
{
	scanf("%d",&t);
	while (t --)
	{
		int A = 1,B = 1;
		bool fl = true;
		scanf("%d",&n);
		for (int i = 1;i <= n;i ++) scanf("%d",a + i);
		minn[n + 1] = s[n + 1] = 0;
		for (int i = n;i >= 1;i --)
			minn[i] = min(minn[i + 1] + a[i],s[i + 1] + a[i]),s[i] = s[i + 1] + a[i];
		int nw = 0;
		for (int i = 1;i <= n;i ++)
		{
//			printf("%d %d %d\n",nw,minn[i],s[i]);
			if (a[i] != 0) nw += a[i];
			else
			{
//				printf("cmp %d %d\n",nw,minn[i]);
				if (minn[i] < 0 && nw > -minn[i]) a[i] = -1,nw --;
				else if (minn[i] >= 0 && nw > 0) a[i] = -1,nw --;
				else a[i] = 1,nw ++;
			}
			if (nw < 0)
			{
				printf("-1\n");
				fl = false;
				break;
			}
		}
		if (!fl) continue;
		for (int i = 1;i <= n;i ++)
			if (a[i] > 0) A ++,B ++;
			else B --;
		int g = gcd(A,B);
		printf("%d %d\n",A / g,B / g);
	}
}