#include <bits/stdc++.h>
using namespace std;
int a[1000005], t[1000005], ans = 0;
void dfs(int l, int r) {
  if (l == r) return;
  int mid = (l + r) >> 1;
  dfs(l, mid);
  dfs(mid + 1, r);
  int i = l, j = mid + 1, p = l;
  while (i <= mid && j <= r) {
    if (a[i] > a[j]) {
      t[p++] = a[j++];
      ans += (mid - i + 1);
    } else {
      t[p++] = a[i++];
    }
  }
  while (i <= mid) {
    t[p++] = a[i++];
  }
  while (j <= r) {
    t[p++] = a[j++];
  }
  for (int k = l; k <= r; k++) a[k] = t[k];
}
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    scanf("%d", &a[i]);
  }
  ans = 0;
  dfs(0, n - 1);
  int sum = 3 * n;
  if ((sum - ans) % 2 == 0) {
    printf("Petr\n");
  } else {
    printf("Um_nik\n");
  }
  return 0;
}
