#include <bits/stdc++.h>
using namespace std;
const int NSIZ = 1000010;
const int MSIZ = 1000010;
const int inf = 1010580540;
const int mxint = 2147483647;
const long long mxll = 9223372036854775807LL;
const long long prime15 = 1000000000000037LL;
const long long mod = 1000000007LL;
const long long mod9 = 1000000009LL;
int n = 250, m = 2000, o, re = 0, test;
long long res = 0;
int a[NSIZ], b[NSIZ];
char c[NSIZ];
bool chk[NSIZ];
int main() {
  int i, j, k, l;
  long long ll = 0, rr = mxll, mid;
  scanf("%d", &test);
  for (int zz = 1; zz <= test; zz++) {
    double mean = 0, var = 0;
    for (i = 0; i < n; i++) {
      scanf("%d", &a[i]);
      mean += a[i];
    }
    mean /= n;
    for (i = 0; i < n; i++) {
      var += (a[i] - mean) * (a[i] - mean);
    }
    var /= n;
    double unif = (double)m * m / 12;
    if (abs(var - mean) <= mean)
      printf("poisson\n");
    else
      printf("uniform\n");
  }
  return 0;
}
