#include <bits/stdc++.h>
using namespace std;
const long long int MOD = 1000000007;
int N;
int qty[2009], a[259];
int poisson(int u) {
  int acum = 0;
  int sigma = (int)round(2 * sqrt(u));
  for (int i = u; i >= u - sigma; i--) acum += qty[i];
  for (int i = u + 1; i < u + sigma + 1; ++i) acum += qty[i];
  return acum > 200;
}
int main() {
  cin >> N;
  while (N--) {
    int p = 0;
    for (int i = 0; i < 2009; ++i) qty[i] = 0;
    for (int i = 0; i < 250; ++i) {
      cin >> a[i];
      if (a[i] > 2000)
        p = 1;
      else
        qty[a[i]]++;
    }
    for (int i = 10; i < 1001; ++i) {
      if (p) break;
      if (qty[i] && poisson(i)) p = 1;
    }
    cout << (p ? "poisson\n" : "uniform\n");
  }
}
