Petr likes to come up with problems about randomly generated data. This time problem is about random permutation. He decided to generate a random permutation this way: he takes identity permutation of numbers from 1 to n and then 3n times takes a random pair of different elements and swaps them. Alex envies Petr and tries to imitate him in all kind of things. Alex has also come up with a problem about random permutation. He generates a random permutation just like Petr but swaps elements 7n+1 times instead of 3n times. Because it is more random, OK?!

You somehow get a test from one of these problems and now you want to know from which one.

Input

In the first line of input there is one integer n (10^{3} ≤ n ≤ 10^{6}).

In the second line there are n distinct integers between 1 and n — the permutation of size n from the test.

It is guaranteed that all tests except for sample are generated this way: First we choose n — the size of the permutation. Then we randomly choose a method to generate a permutation — the one of Petr or the one of Alex. Then we generate a permutation using chosen method.

Output

If the test is generated via Petr's method print "Petr" (without quotes). If the test is generated via Alex's method print "Um_nik" (without quotes).

Example

Input

5
2 4 5 1 3


Output

Petr

Note

Please note that the sample is not a valid test (because of limitations for n) and is given only to illustrate input/output format. Your program still has to print correct answer to this test to get AC.

Due to randomness of input hacks in this problem are forbidden.
#include <bits/stdc++.h>
using namespace std;
struct segtree {
  vector<long long int> ST;
  segtree(int n) { ST.resize(5 * n + 5, 0); }
  void Build(vector<long long int> &A, int v, int tl, int tr) {
    if (tl == tr) {
      ST[v] = A[tl];
    } else {
      int tm = (tl + tr) / 2;
      Build(A, v * 2, tl, tm);
      Build(A, v * 2 + 1, tm + 1, tr);
      ST[v] = ST[v * 2] + ST[v * 2 + 1];
    }
  }
  int query(int v, int tl, int tr, int l, int r) {
    if (l > r) {
      return 0;
    }
    if (l == tl && r == tr) {
      return ST[v];
    }
    int tm = (tl + tr) / 2;
    return (query(v * 2, tl, tm, l, min(r, tm)) +
            query(v * 2 + 1, tm + 1, tr, max(l, tm + 1), r));
  }
  void modify(int v, int tl, int tr, int pos, long long int val) {
    if (tl == tr) {
      ST[v] = val;
    } else {
      int tm = (tl + tr) / 2;
      if (pos <= tm) {
        modify(v * 2, tl, tm, pos, val);
      } else {
        modify(v * 2 + 1, tm + 1, tr, pos, val);
      }
      ST[v] = ST[v * 2] + ST[v * 2 + 1];
    }
  }
};
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int n;
  cin >> n;
  long long int N = 1e6 + 2;
  segtree ST(N);
  long long calc = 0;
  for (int i = 1; i <= n; i++) {
    int act;
    cin >> act;
    calc = calc + ST.query(1, 0, N, act, N);
    ST.modify(1, 0, N, act, 1);
  }
  if (calc % 2 == n % 2) {
    cout << "Petr";
  } else {
    cout << "Um_nik";
  }
  return 0;
}
