#include <bits/stdc++.h>
using namespace std;
const int MAX = 7000;
double log_fact[MAX];
double PoissonProb(int p, int k) {
  (k) = min((k), (MAX - 1));
  return k * log(p) - p - log_fact[k];
}
int main() {
  log_fact[0] = 0;
  for (int i = 1; i < MAX; ++i) log_fact[i] = log_fact[i - 1] + log(i);
  int q;
  scanf("%d", &q);
  for (int i = 0; i < q; ++i) {
    vector<int> in(250);
    double sum = 0.0;
    for (int& e : in) scanf("%d", &e), sum += e;
    int p = ceil(sum / ((int)(in).size()));
    double eq_prob = ((int)(in).size()) * -log(2 * p + 1);
    double poisson_prob = 0;
    for (int& e : in) poisson_prob += PoissonProb(p, e);
    if (poisson_prob > eq_prob)
      printf("poisson\n");
    else
      printf("uniform\n");
  }
  return 0;
}
