#include <bits/stdc++.h>
using namespace std;
template <typename T1, typename T2>
inline T1 max(T1 a, T2 b) {
  return a < b ? b : a;
}
template <typename T1, typename T2>
inline T1 min(T1 a, T2 b) {
  return a < b ? a : b;
}
const char lf = '\n';
namespace ae86 {
const int bufl = 1 << 15;
char buf[bufl], *s = buf, *t = buf;
inline int fetch() {
  if (s == t) {
    t = (s = buf) + fread(buf, 1, bufl, stdin);
    if (s == t) return EOF;
  }
  return *s++;
}
inline int ty() {
  int a = 0;
  int b = 1, c = fetch();
  while (!isdigit(c)) b ^= c == '-', c = fetch();
  while (isdigit(c)) a = a * 10 + c - 48, c = fetch();
  return b ? a : -a;
}
}  // namespace ae86
using ae86::ty;
const int N = 250, _ = N + 7;
int val[_];
void finder() {
  for (int i = 1; i <= N; i++) val[i] = ty();
  double sval2 = 0;
  for (int i = 1; i <= N; i++) sval2 += val[i] * val[i];
  double d = sqrt(sval2 / N);
  int cnt = 0;
  for (int i = 1; i <= N; i++)
    if (abs(val[i]) < d + d) cnt++;
  cout << (cnt < N ? "poisson" : "uniform") << lf;
}
int main() {
  ios::sync_with_stdio(0), cout.tie(nullptr);
  int t = ty();
  while (t--) finder();
  return 0;
}
