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;
vector<int> temp;
long long cnt = 0;
void merge(vector<int> &arr, int from, int mid, int to) {
  int ptr1 = from;
  for (int ptr2 = mid; ptr2 < to; ++ptr2) {
    while (ptr1 < mid && arr[ptr1] < arr[ptr2]) ++ptr1;
    cnt += mid - ptr1;
  }
  int i = from, j = mid, c = from;
  while (i < mid && j < to) {
    if (arr[j] < arr[i])
      temp[c] = arr[j], ++j;
    else
      temp[c] = arr[i], ++i;
    ++c;
  }
  while (i < mid) temp[c] = arr[i], ++i, ++c;
  while (j < to) temp[c] = arr[j], ++j, ++c;
  for (int i = from; i < to; ++i) arr[i] = temp[i];
}
void merge_sort(vector<int> &arr, int from, int to) {
  if (to - from < 2) return;
  int mid = from + ((to - from) >> 1);
  merge_sort(arr, from, mid);
  merge_sort(arr, mid, to);
  merge(arr, from, mid, to);
}
void sort(vector<int> &arr) {
  temp = arr;
  merge_sort(arr, 0, arr.size());
}
int main() {
  int n;
  cin >> n;
  vector<int> arr(n);
  for (auto &i : arr) cin >> i;
  sort(arr);
  if (cnt % 2 == n % 2)
    cout << "Petr";
  else
    cout << "Um_nik";
  return 0;
}
