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;
const long long int mod = 1e9 + 7;
vector<long long int> v(1e6 + 10);
map<long long int, long long int> mymap;
long long int power(long long int a, long long int b) {
  a %= mod;
  long long int ret = 1;
  while (b) {
    if (b & 1) ret *= a;
    a *= a;
    if (ret >= mod) ret %= mod;
    if (a >= mod) a %= mod;
    b >>= 1;
  }
  return ret;
}
long long int add(long long int a, long long int b) {
  return (((a % mod) + (b % mod)) % mod);
}
long long int mul(long long int a, long long int b) {
  return (((a % mod) * (b % mod)) % mod);
}
long long int bs(vector<long long int> v, long long int l, long long int r,
                 long long int ele) {
  long long int mid;
  do {
    mid = l + ((r - l) / 2);
    if (v[mid] == ele)
      return mid;
    else if (ele < v[mid])
      r = mid - 1;
    else
      l = mid + 1;
  } while (l <= r);
  return -1;
}
long long int solve(long long int n) {
  long long int c = 0;
  for (long long int i = 0; i < n; i++) {
    if (v[i] != i + 1) {
      c++;
      long long int temppos = mymap[i + 1];
      mymap[v[i]] = temppos;
      v[temppos - 1] = v[i];
      v[i] = i + 1;
      mymap[i + 1] = i + 1;
    }
  }
  return c;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long int n;
  cin >> n;
  for (long long int i = 0; i < n; i++) {
    cin >> v[i];
    mymap[v[i]] = i + 1;
  }
  long long int ans = solve(n);
  if (n % 2) {
    if (ans % 2 != 0)
      cout << "Petr\n";
    else
      cout << "Um_nik\n";
  } else {
    if (ans % 2 == 0)
      cout << "Petr\n";
    else
      cout << "Um_nik\n";
  }
  return 0;
}
