#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 100;
long long n, a[N], f[N], ans;
void update(long long x) {
  for (x++; x < N; x += (x & (-x))) f[x]++;
}
long long get(long long x) {
  long long ans = 0;
  for (x++; x > 0; x -= (x & (-x))) ans += f[x];
  return ans;
}
int main() {
  ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  cin >> n;
  for (int i = 0; i < n; i++) cin >> a[i];
  for (int i = n - 1; i >= 0; i--) {
    ans += get(a[i]);
    update(a[i]);
  }
  ans = ans % 2;
  if (n % 2 == ans)
    cout << "Petr";
  else
    cout << "Um_nik";
  return 0;
}
