#include <bits/stdc++.h>
using namespace std;
int tree[2 * 1000000 + 5];
void update(int pos) {
  while (pos <= (2 * 1000000)) {
    tree[pos]++;
    pos += (pos ^ (pos & (pos - 1)));
  }
}
int querry(int pos) {
  int ans = 0;
  while (pos > 0) {
    ans += tree[pos];
    pos = pos & (pos - 1);
  }
  return ans;
}
int main() {
  int n, i, x, cnt = 0;
  cin >> n;
  for (i = 1; i <= n; i++) {
    cin >> x;
    cnt += x - querry(x) - 1;
    update(x);
    cnt = cnt % 2;
  }
  if (n * 3 % 2 == cnt) {
    cout << "Petr" << '\n';
  } else
    cout << "Um_nik" << '\n';
  return 0;
}
