#include <bits/stdc++.h>
using namespace std;
long long tree[4 * 1000005];
void update(int v, int l, int r, int ind) {
  if (l > r || l > ind || ind > r) return;
  if (l == r) {
    tree[v] = 1;
    return;
  }
  int mid = (l + r) / 2;
  update(2 * v, l, mid, ind);
  update(2 * v + 1, mid + 1, r, ind);
  tree[v] = tree[2 * v] + tree[2 * v + 1];
}
long long query(int v, int l, int r, int lt, int rt) {
  if (l > r || l > rt || lt > r || lt > rt) return 0;
  if (lt <= l && r <= rt) return tree[v];
  int mid = (l + r) / 2;
  return query(2 * v, l, mid, lt, rt) + query(2 * v + 1, mid + 1, r, lt, rt);
}
int n;
int a;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  long long inv = 0;
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> a;
    inv += query(1, 1, n, a + 1, n);
    update(1, 1, n, a);
  }
  if (inv % 2 == n % 2)
    cout << "Petr\n";
  else
    cout << "Um_nik\n";
  return 0;
}
