#include <bits/stdc++.h>

#define pb push_back
#define pii pair<int, int>
#define f first
#define s second

using namespace std;

/*
This sol doesn't work. 
The 1s want to be eliminated right to left
The -1s want to be eliminated left to right
so maybe going from right to left with -1s and then picking the first 1 before 
it will work, but it's a bit tricky to implement.
XDDDDDDDDDD
Im stupid
*/

int main() {
	cin.tie(0)->sync_with_stdio(0);
	int t; cin >> t;
	while (t--){
	  int n;
	  cin >> n;
	  int total = 1;
	  vector<int> ones;
	  vector<int> zeros;
	  vector<int> negs;
	  for(int i = 0; i < n; i++){
	    int a;
	    cin >> a;
	    if(a == 1){
	      total++;
	      ones.pb(i);
	    }else if(a == 0){
	      zeros.pb(i);
	    }else{
	      negs.pb(i);
	    }
	  }
	  vector<pii> vec;
	  int ind = (int)negs.size()-1;
	  for(int i = (int)ones.size()-1; i >= 0; i--){
		  if(ind < 0) break;
		  if(negs[ind] > ones[i]){
			ones[i] = -1;
			negs[ind] = -1;
			ind--;
		  }
	  }
	  int givens = 0;
	  int combines = 0;
	  for(int i = 0; i < ones.size(); i++){
	    if(ones[i] == -1) continue;
	    vec.pb({ones[i], 1});
	  }
	  for(int i = 0; i < negs.size(); i++){
	    if(negs[i] == -1) continue;
	    vec.pb({negs[i], -1});
	    combines++;
	  }
	  for(int i = 0; i < zeros.size(); i++){
	    vec.pb({zeros[i], 0});
	  }
	  sort(vec.begin(), vec.end());
	  /*
	  for(int i = 0; i < vec.size(); i++){
	    cout << vec[i].s << " ";
	  }
	  cout << "\n";
	  */
	  bool works = true;
	  for(int i = 0; i < vec.size(); i++){
	    if(vec[i].s == 1) givens++;
	    else if(vec[i].s == -1){
	      givens--;
	      combines--;
	    }else{
	      if(givens > combines) givens--;
	      else{
		givens++;
		total++;
	      }
	    }
	    if(givens < 0) works = false;
	  }
	  if(works){
	    int g = __gcd(total, givens+1);
	    cout << total/g << " " << (givens+1)/g << "\n";
	  }else{
	    cout << -1 << "\n";
	  }
	}
	cout << endl;
	return 0;
}