#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 100;
struct node {
  int v, id;
} mp[N];
bool operator<(node a, node b) { return a.v < b.v; }
int n;
bool used[N];
void solve() {
  sort(mp + 1, mp + n + 1);
  memset(used, false, sizeof(used));
  int ans = 0;
  for (int i = 1; i <= n; i++) {
    if (mp[i].id != i) {
      int cnt = 0;
      while (mp[i].id != i) {
        swap(mp[i].id, mp[mp[i].id].id);
        cnt++;
      }
      ans += cnt;
    }
  }
  if ((ans + n) % 2)
    puts("Um_nik");
  else
    puts("Petr");
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &mp[i].v);
    mp[i].id = i;
  }
  solve();
  return 0;
}
