Problem: Heidi is a statistician to the core, and she likes to study the evolution of marmot populations in each of V (1 ≤ V ≤ 100) villages! So it comes that every spring, when Heidi sees the first snowdrops sprout in the meadows around her barn, she impatiently dons her snowshoes and sets out to the Alps, to welcome her friends the marmots to a new season of thrilling adventures.

Arriving in a village, Heidi asks each and every marmot she comes across for the number of inhabitants of that village. This year, the marmots decide to play an April Fools' joke on Heidi. Instead of consistently providing the exact number of inhabitants P (10 ≤ P ≤ 1000) of the village, they respond with a random non-negative integer k, drawn from one of two types of probability distributions:

  * Poisson (d'avril) distribution: the probability of getting an answer k is <image> for k = 0, 1, 2, 3, ..., 
  * Uniform distribution: the probability of getting an answer k is <image> for k = 0, 1, 2, ..., 2P. 



Heidi collects exactly 250 answers per village. Every village follows either the Poisson or the uniform distribution. Heidi cannot tell marmots apart, so she may query some marmots several times, and each time the marmot will answer with a new number drawn from the village's distribution.

Can you help Heidi to find out whether a village follows a Poisson or a uniform distribution?

Input

The first line of input will contain the number of villages V (1 ≤ V ≤ 100). The following V lines each describe one village. The description of each village consists of 250 space-separated integers k, drawn from one of the above distributions.

Output

Output one line per village, in the same order as provided in the input. The village's line shall state poisson if the village's distribution is of the Poisson type, and uniform if the answer came from a uniform distribution.

Example

Input

2
92 100 99 109 93 105 103 106 101 99 ... (input is truncated)
28 180 147 53 84 80 180 85 8 16 ... (input is truncated)

Output

poisson
uniform

Note

The full example input is visually represented below, along with the probability distribution function it was drawn from (the y-axis is labeled by its values multiplied by 250).

<image>

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:256000000")
std::uniform_int_distribution<std::mt19937::result_type> udist(0, 1);
std::mt19937 rng;
using namespace std;
FILE *in, *out;
int ri() {
  int a;
  fscanf(in, "%d", &a);
  return a;
}
double rf() {
  double a;
  fscanf(in, "%lf", &a);
  return a;
}
char sbuf[100005];
string rstr() {
  char c;
  char *b = sbuf;
  while (c = fgetc(in)) {
    if (c == '\n' || c == 255) break;
    *b++ = c;
  }
  *b = 0;
  return sbuf;
}
long long nod(long long a, long long b) {
  if (a == 1 || b == 1) return 1;
  if (a == 0) return b;
  if (b == 0) return a;
  return nod(b % a, a);
}
vector<int> primes;
void calculatePrimes() {
  primes.push_back(2);
  for (int i = 3; i < 100000; i += 2) {
    bool bFound = false;
    int m = (int)sqrt((float)i);
    for (int j = 1; j < primes.size() && !bFound && primes[j] <= m; j++)
      bFound = ((i % primes[j]) == 0);
    if (!bFound) primes.push_back(i);
  }
}
bool isPrime(int p) {
  for (int i : primes)
    if (p != i && (p % i) == 0) return false;
  return true;
}
void egcd(int a, int b, int &g, int &x, int &y) {
  if (a == 0) {
    g = b;
    x = 0;
    y = 1;
    return;
  }
  egcd(b % a, a, g, y, x);
  x = x - (b / a) * y;
}
int modinv(int a, int m) {
  int g = 0, x = 0, y = 0;
  egcd(a, m, g, x, y);
  return (x + m) % m;
}
long long modpow(int a, long long n, int p) {
  long long res = 1;
  long long curp = (a % p);
  while (n) {
    if (n & 1) {
      res = (res * curp) % p;
    }
    curp = (curp * curp) % p;
    n /= 2;
  }
  return res;
}
long long n, m, k;
int countN(string s, string c) {
  vector<long long> cnt(20);
  cnt[0] = 1;
  for (int i = (0); i < (((s.size()))); ++i) {
    for (int j = (0); j < (((c.size()))); ++j) {
      if (s[i] == c[j]) {
        cnt[j + 1] += cnt[j];
      }
    }
  }
  return cnt[c.size()];
}
int main() {
  cin >> n;
  int vl[250];
  for (int i = (0); i < (((n))); ++i) {
    std::default_random_engine generator;
    int med = 20;
    long long sum = 0;
    for (int j = (0); j < (((250))); ++j) {
      vl[j] = rand() * med / RAND_MAX;
      scanf("%d", vl + j);
      sum += vl[j];
    }
    double mid = sum / 250.;
    int c = 0;
    for (int j = (0); j < (((250))); ++j)
      if (fabs(vl[j] - mid) > mid / 2) c++;
    if (c > 75)
      cout << "uniform" << endl;
    else
      cout << "poisson" << endl;
  }
  return 0;
}