#include <bits/stdc++.h>
using namespace std;
const int Max = 1e6 + 5;
int a[Max];
int tmp[Max];
long long cnt = 0;
void Merge(int l, int mid, int r) {
  int i = l, j = mid + 1, k = l;
  while (i <= mid && j <= r) {
    if (a[i] < a[j])
      tmp[k++] = a[i++];
    else {
      tmp[k++] = a[j++];
      cnt += mid - i + 1;
    }
  }
  while (i <= mid) tmp[k++] = a[i++];
  while (j <= r) tmp[k++] = a[j++];
  for (int p = l; p <= r; ++p) a[p] = tmp[p];
}
void MergeSort(int l, int r) {
  if (l < r) {
    int mid = (l + r) >> 1;
    MergeSort(l, mid);
    MergeSort(mid + 1, r);
    Merge(l, mid, r);
  }
}
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 0; i < n; ++i) scanf("%d", a + i);
  MergeSort(0, n - 1);
  if (n & 1) {
    if (cnt & 1)
      printf("Petr\n");
    else
      printf("Um_nik\n");
  } else {
    if (cnt & 1)
      printf("Um_nik\n");
    else
      printf("Petr\n");
  }
}
