#include <bits/stdc++.h>
using namespace std;
const int N = 1000010;
int n, a[N], b[N];
void add(int x) {
  for (; x <= n; x += (x & (-x))) b[x]++;
}
int query(int x) {
  int ret = 0;
  for (; x; x -= (x & (-x))) ret += b[x];
  return ret;
}
int main() {
  int cnt = 0;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  for (int i = n; i; i--) {
    cnt += query(a[i]);
    add(a[i]);
  }
  if ((cnt & 1) == ((3 * n) & 1))
    printf("Petr\n");
  else
    printf("Um_nik\n");
  return 0;
}
