#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6;
int n, a[maxn], seg[4 * maxn];
void add(int idx, int first = 0, int second = n, int id = 1) {
  if (first == second - 1) {
    seg[id]++;
    return;
  }
  int mid = (first + second) >> 1;
  if (idx < mid)
    add(idx, first, mid, id * 2 + 0);
  else
    add(idx, mid, second, id * 2 + 1);
  seg[id] = seg[id * 2 + 0] + seg[id * 2 + 1];
}
int get(int l, int r, int first = 0, int second = n, int id = 1) {
  if (l == first && r == second) return seg[id];
  int mid = (first + second) >> 1, ret = 0;
  if (l < mid) ret += get(l, min(mid, r), first, mid, id * 2 + 0);
  if (r > mid) ret += get(max(l, mid), r, mid, second, id * 2 + 1);
  return ret;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin >> n;
  for (int i = 0; i < n; i++) cin >> a[i], a[i]--;
  long long int cnt = 0;
  for (int i = 0; i < n; i++) {
    cnt += get(a[i], n);
    add(a[i]);
  }
  if (n % 2 == 0 && cnt % 2 == 0) cout << "Petr" << endl;
  if (n % 2 == 0 && cnt % 2 == 1) cout << "Um_nik" << endl;
  if (n % 2 == 1 && cnt % 2 == 0) cout << "Um_nik" << endl;
  if (n % 2 == 1 && cnt % 2 == 1) cout << "Petr" << endl;
  return 0;
}
