#include <bits/stdc++.h>
using namespace std;
int a[1000010], b[1000010], n;
long long ans;
void ssort(int x, int y) {
  if (y - x <= 1) return;
  int mid = (x + y) / 2;
  ssort(x, mid);
  ssort(mid, y);
  int i, j, k;
  i = x;
  j = mid;
  k = x;
  while (i < mid || j < y) {
    if (j >= y || (i < mid && a[i] <= a[j]))
      b[k++] = a[i++];
    else {
      if (i < mid) ans = ans + mid - i;
      b[k++] = a[j++];
    }
  }
  for (i = x; i < y; i++) a[i] = b[i];
}
int main() {
  int i, j, k;
  while (scanf("%d", &n) != EOF) {
    if (n == 0) break;
    memset(a, 0, sizeof(a));
    memset(b, 0, sizeof(b));
    for (i = 0; i < n; i++) scanf("%d", &a[i]);
    ans = 0;
    ssort(0, n);
    if ((ans % 2) == (3 * n % 2))
      cout << "Petr" << endl;
    else
      cout << "Um_nik" << endl;
  }
  return 0;
}
