#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<int> vi;

#define INF 1000000001

int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);

	int t, n;
	cin >> t;
	while (t--)
	{
		cin >> n;
		int a = 0, b = 0, c = 0, x, sum = 0, cnt = 1;
		bool possible = true;
		vector<int> numbers(n), maxi(n + 1);
		for (int i = 0; i < n; i++)
		{
			maxi[i] = a + c - b;
			cin >> numbers[i];
			if (numbers[i] == 1)
				a++;
			else if (numbers[i] == -1)
				b++;
			else
				c++;
			if (a + c + 1 - b == 0)
				possible = false;
		}
		maxi[n] = a + c - b;
		if (possible)
		{
			sum = a + c + 1;
			cnt = 1 + a + c - b;
			int a2 = 0, b2 = 0, c2 = 0, m = maxi[n];
			for (int i = n - 1; i >= 0; i--)
			{
				if (numbers[i] == 1)
					a2++;
				else if (numbers[i] == -1)
					b2++;
				else
				{
					c2++;
				}
				m = min(m, maxi[i]);
				if (c2 > m)
					break;
				sum = a + (c - c2) + 1;
				cnt = 1 + a + (c - c2) - c2 - b;
			}
		}

		if (!possible)
		{
			cout << -1 << '\n';
			continue;
		}

		int g = __gcd(sum, cnt);
		cout << sum / g << ' ' << cnt / g << '\n';
	}
}