#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 50;
int n, p[N], q[N];
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) scanf("%d", &p[i]), q[p[i]] = i;
  bool o = 0;
  for (int i = 1; i <= n; i++) {
    if (q[i] != i) {
      o ^= 1;
      int x = q[i];
      swap(q[i], q[p[i]]);
      swap(p[i], p[x]);
    }
  }
  if (!(n & 1) ^ o)
    puts("Petr");
  else
    puts("Um_nik");
  return 0;
}
