#include <bits/stdc++.h>
using namespace std;
const int MN = 1e6 + 5;
int N, c[MN];
inline void ins(int x) {
  for (int i = x; i <= N; i += i & -i) c[i] ^= 1;
}
inline int qry(int x) {
  int ret = 0;
  for (int i = x; i; i -= i & -i) ret ^= c[i];
  return ret;
}
int main() {
  scanf("%d", &N);
  int cur = 0;
  for (int i = 1; i <= N; ++i) {
    int x;
    scanf("%d", &x);
    cur ^= qry(N) ^ qry(x);
    ins(x);
  }
  N &= 1;
  if (N == cur)
    printf("Petr\n");
  else
    printf("Um_nik\n");
  return 0;
}
