#include <bits/stdc++.h>
using namespace std;
const int maxn = 250;
int a[maxn + 5], cnt[maxn * 10], mx, T, sum, flag, r;
int main() {
  int T;
  scanf("%d", &T);
  while (T--) {
    mx = 0;
    flag = 0;
    memset(cnt, 0, sizeof cnt);
    for (int i = 1; i <= maxn; i++) {
      scanf("%d", &a[i]);
      mx = max(mx, a[i]);
      if (mx > 2000) break;
      cnt[a[i]]++;
    }
    if (mx > 2000) {
      puts("poisson");
      continue;
    }
    r = 0;
    sum = cnt[0];
    for (int l = 0; l <= mx / 2; l++) {
      while (r < mx && r < l + mx / 2) sum += cnt[r++];
      if (sum > 0.7 * maxn) {
        flag = 1;
        break;
      }
      sum -= cnt[l];
    }
    if (flag == 1)
      puts("poisson");
    else
      puts("uniform");
  }
  return 0;
}
