#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 5;
int n;
int d[maxn];
int lowbit(int x) { return x & -x; }
void update(int x, int v) {
  while (x <= maxn) {
    d[x] += v;
    x += lowbit(x);
  }
}
int query(int x) {
  int ans = 0;
  while (x) {
    ans += d[x];
    x -= lowbit(x);
  }
  return ans;
}
int main() {
  int n;
  scanf("%d", &n);
  int x;
  int cnt = 0;
  for (int i = 1; i <= n; i++) {
    scanf("%d", &x);
    cnt += query(maxn) - query(x);
    update(x, 1);
  }
  if (n & 1) {
    if (cnt & 1)
      cout << "Petr\n";
    else
      cout << "Um_nik\n";
  } else {
    if (cnt & 1)
      cout << "Um_nik\n";
    else
      cout << "Petr\n";
  }
  return 0;
}
