#include <bits/stdc++.h>
using namespace std;
const int N = 1000010;
const int M = 200010;
const long long inf = 0x7fffffff;
inline long long read() {
  long long x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return f * x;
}
int n, flag, ans;
int a[N];
void add(int x, int k) {
  while (x <= n) {
    a[x] += k;
    x += x & -x;
  }
}
int ask(int x) {
  int ret = 0;
  while (x) {
    ret += a[x];
    x -= x & -x;
  }
  return ret;
}
int main() {
  n = read();
  for (int i = 1; i <= n; i++) {
    int tmp = read();
    add(tmp, 1);
    ans += ask(n) - ask(tmp);
  }
  if (n & 1) flag = 1;
  if (flag) {
    if (ans & 1)
      printf("Petr");
    else
      printf("Um_nik");
  } else {
    if (ans & 1)
      printf("Um_nik");
    else
      printf("Petr");
  }
  return 0;
}
