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>
#pragma GCC optimize("O3", "unroll-loops")
using namespace std;
template <typename T1, typename T2>
inline void checkmin(T1 &x, T2 y) {
  if (x > y) x = y;
}
template <typename T1, typename T2>
inline void checkmax(T1 &x, T2 y) {
  if (x < y) x = y;
}
template <typename T1>
inline void sort(T1 &arr) {
  sort(arr.begin(), arr.end());
}
template <typename T1>
inline void shuffle(T1 &arr) {
  for (int i = -arr.size(); i < arr.size(); ++i) {
    int first = ((rand() << 16) + rand()) % arr.size(),
        second = ((rand() << 16) + rand()) % arr.size();
    swap(arr[first], arr[second]);
  }
}
template <typename T1>
inline void reverse(T1 &arr) {
  reverse(arr.begin(), arr.end());
}
vector<long long> arr;
vector<bool> used;
long long dfs(long long v) {
  used[v] = true;
  if (!used[arr[v]])
    return dfs(arr[v]) + 1;
  else
    return 1;
}
signed main() {
  long long n;
  cin >> n;
  arr = vector<long long>(n);
  for (auto &i : arr) cin >> i;
  for (auto &i : arr) --i;
  used = vector<bool>(n);
  long long ans = 0;
  for (int i = 0; i < n; ++i)
    if (!used[i]) ans = (ans + (dfs(i) % 2 == 0 ? 1 : 0)) % 2;
  if (ans == (3 * n) % 2)
    cout << "Petr";
  else
    cout << "Um_nik";
  return 0;
}
