#include <bits/stdc++.h>
using namespace std;
struct FenwickTree {
  vector<int> A;
  int MOD;
  FenwickTree(int size, int mod) {
    A.resize(size + 1, 0);
    MOD = mod;
  }
  int sum(int i) {
    i++;
    long long sum = 0;
    while (i > 0) {
      sum += A[i];
      i -= (i) & (-i);
    }
    return (int)(sum % MOD);
  }
  void add(int i, int k) {
    k %= MOD;
    i++;
    while (i < A.size()) {
      A[i] += k;
      A[i] %= MOD;
      i += (i) & (-i);
    }
  }
};
int main() {
  int n;
  cin >> n;
  FenwickTree ft(n + 1, 1000000000);
  int cnt = 0;
  for (int i = 1; i <= n; i++) {
    long long temp;
    cin >> temp;
    cnt += i - 1 - ft.sum(temp);
    ft.add(temp, 1);
  }
  if ((cnt + n) % 2 == 0) {
    cout << "Petr\n";
  } else {
    cout << "Um_nik\n";
  }
  return 0;
}
