#include <bits/stdc++.h>

constexpr int INF = 1e9;

void solve()
{
	int n; std::cin >> n;
	std::vector<int> a(n), s(n + 1);
	for(int i = 0; i < n; i++) std::cin >> a[i];
	for(int i = 0; i < n; i++) s[i + 1] = s[i] + (a[i] == -1 ? -1 : 1);

	int min = INF;
	for(int i = 1; i <= n; i++) min = std::min(min, s[i]);

	if(min < 0)
	{
		std::cout << -1 << "\n";
		return;
	}
	min = s[n] / 2;

	int tot = std::ranges::count(a, 0);
	int x = 1, y = 1;
	for(int i = 0; i < n; i++)
	{
		if(a[i] == 1) x++, y++;
		else if(a[i] == -1) y--;
		else
		{
			if(tot > min) x++, y++, tot--;
			else y--;
		}
	}

	int g = std::gcd(x, y);
	x /= g, y /= g;

	std::cout << x << " " << y << "\n";
}

int main()
{
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);

	int t; std::cin >> t;
	while(t--) solve();

	return 0;
}