#include<iostream>
#include<algorithm>
#include<cmath>
#include<bitset>
#include<vector>
#include<stack>
#include<sstream>
#include<cstdio>
#include <stack>
using namespace std;
int a[1000001];
int gcd(int a, int b)
{
	if (a < b)
		swap(a, b);
	if (b == 0)
		return a;
	else
		return gcd(b, a - b);

}
int main()
{
	int T;
	cin >> T;
	int n,s;
	bool flag;
	while (T--)
	{
		flag = false;
		cin >> n;
		for (int i = 1; i <= n; i++)
			scanf("%d", &a[i]);
		int len = 1, maxn = 1;
		for (int i = 1; i <= n; i++)
		{
			if (a[i] == 1)
				len++;
			else if (a[i] == -1)
			{
				if (len == 1)
				{
					flag = true;
					break;
				}
				else
				{
					len--;
					maxn = maxn + 1;
				}
			}
			else
			{
				if (len == 1||len==2&&a[i+1]==-1&&i+1<=n)
				{
					len++;
				}
				else
				{
					len--;
					maxn = maxn + 1;
				}
			}

	   }

		if (flag)
			printf("-1\n");
		else
		{
			if (maxn == 1)
				printf("1 1\n");
			else
			{
				int x = len - 1 + maxn;
				int y = len;
				int w = gcd(x,y);
				printf("%d %d\n",x/w,y/w);
			}
		}

	}
}