#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6;
int n, tr[maxn + 5];
void Inc(int x) {
  for (; x <= n; x += x & (-x)) ++tr[x];
}
int Sum(int x) {
  int r = 0;
  for (; x; x -= x & (-x)) r += tr[x];
  return r;
}
int main() {
  scanf("%d", &n);
  long long inv = 0;
  for (int i = 1, a; i <= n; ++i) {
    scanf("%d", &a);
    inv += (i - 1) - Sum(a);
    Inc(a);
  }
  long long del = 7LL * n + 1LL - inv;
  if (del % 2 == 0)
    puts("Um_nik");
  else
    puts("Petr");
  return 0;
}
