#include <bits/stdc++.h>
using namespace std;
const int N = 1000001;
int a[N], bit[N];
int n;
inline int lowbit(int i) { return i & (-i); }
int sum(int i) {
  int sum = 0;
  while (i > 0) {
    sum += bit[i];
    i -= lowbit(i);
  }
  return sum;
}
void add(int i, int x) {
  while (i <= n) {
    bit[i] += x;
    i += lowbit(i);
  }
}
int main() {
  cin >> n;
  for (int i = 0; i < n; i++) cin >> a[i];
  int ans = 0;
  for (int i = 0; i < n; i++) {
    ans += i - sum(a[i]);
    add(a[i], 1);
  }
  if ((ans & 1) == (n & 1))
    cout << "Petr";
  else
    cout << "Um_nik";
  cout << '\n';
  return 0;
}
