#include <bits/stdc++.h>
using namespace std;
inline long long rd() {
  long long x = 0;
  int ch = getchar(), f = 1;
  while (!isdigit(ch) && (ch != '-') && (ch != EOF)) ch = getchar();
  if (ch == '-') {
    f = -1;
    ch = getchar();
  }
  while (isdigit(ch)) {
    x = (x << 1) + (x << 3) + ch - '0';
    ch = getchar();
  }
  return x * f;
}
inline void rt(long long x) {
  if (x < 0) putchar('-'), x = -x;
  if (x >= 10)
    rt(x / 10), putchar(x % 10 + '0');
  else
    putchar(x + '0');
}
const int maxn = 2505;
double pa[maxn], push_back[maxn], e = exp(1);
int a[255], ex[maxn];
double sqr(double a) { return a * a; }
int main() {
  for (int T = rd(); T--;) {
    int ave = 0;
    for (int i = int(1); i <= (int)(250); i++) a[i] = rd(), ave += a[i];
    ave /= 250;
    memset(ex, 0, sizeof ex);
    for (int i = int(1); i <= (int)(250); i++) ex[a[i]]++;
    for (int k = int(0); k <= (int)(2 * ave); k++) {
      pa[k] = 1;
      for (int j = int(1); j <= (int)(k); j++) {
        pa[k] = pa[k] * ave / j;
        if (j <= ave) pa[k] /= e;
      }
      if (k <= ave) pa[k] *= exp(-ave + k);
      pa[k] *= 250;
    }
    for (int k = int(0); k <= (int)(2 * ave); k++)
      push_back[k] = 250.0 / (2 * ave + 1);
    double sa = 0, sb = 0;
    for (int k = int(0); k <= (int)(2 * ave); k++)
      sa += sqr(pa[k] - ex[k]), sb += sqr(push_back[k] - ex[k]);
    if (sa < sb)
      puts("poisson");
    else
      puts("uniform");
  }
}
