#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 7;
int n;
long long sum[maxn], a[maxn], OUT = 0;
void add(int x, long long ad) {
  while (x <= n) {
    sum[x] += ad;
    x += (x & (-x));
  }
  return;
}
long long getsum(int x) {
  long long ans = 0;
  while (x > 0) {
    ans += sum[x];
    x -= (x & (-x));
  }
  return ans;
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%I64d", &a[i]);
    OUT += (getsum(n) - getsum(a[i] - 1));
    add(a[i], 1);
  }
  if (n % 2 == 0) {
    if (OUT % 2 == 0)
      printf("Petr\n");
    else
      printf("Um_nik\n");
  } else {
    if (OUT % 2 == 0)
      printf("Um_nik\n");
    else
      printf("Petr\n");
  }
  return 0;
}
