#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 7;
int a[N], tr[N];
int n;
int sum(int r) {
  int res = 0;
  for (; r > 0; r = (r & (r + 1)) - 1) res += tr[r];
  return res;
}
void upd(int r, int x) {
  for (; r <= n; r = (r | (r + 1))) tr[r] += x;
}
int get_sum(int l, int r) { return (sum(r) - sum(l - 1)); }
long long ans = 0;
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
  }
  for (int i = 1; i <= n; i++) {
    ans += get_sum(a[i] + 1, n);
    upd(a[i], 1);
  }
  if (n & 1) {
    if (ans & 1) {
      puts("Petr");
    } else {
      puts("Um_nik");
    }
  } else {
    if (ans & 1) {
      puts("Um_nik");
    } else {
      puts("Petr");
    }
  }
}
