#include <bits/stdc++.h>
using namespace std;
int n, a[1000006], b[1000006];
bool ans;
void merge(int l, int r) {
  if (l == r) return;
  int mid = l + r >> 1;
  merge(l, mid), merge(mid + 1, r);
  for (int i = l, j = mid + 1, t = l; i <= mid || j <= r;) {
    if (i <= mid && (j > r || a[i] < a[j]))
      b[t++] = a[i++];
    else
      b[t++] = a[j++], ans ^= (mid + 1 - i) & 1;
  }
  for (int i = l; i <= r; i++) a[i] = b[i];
}
int main() {
  scanf("%d", &n);
  ans = n & 1;
  for (int i = 1; i <= n; i++) scanf("%d", a + i);
  merge(1, n);
  puts(ans ? "Um_nik" : "Petr");
}
