#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 5;
int bit[maxn];
int lowbit(int x) { return x & -x; }
int getans(int x) {
  int ans = 0;
  while (x) {
    ans += bit[x];
    x -= lowbit(x);
  }
  return ans;
}
void insert(int x) {
  while (x < maxn) {
    bit[x]++;
    x += lowbit(x);
  }
}
int main() {
  int n, x;
  long long c = 0;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &x);
    insert(x);
    c += getans(x - 1);
  }
  long long r = (long long)n * (n - 1) / 2 - c;
  if (n % 2 == r % 2) {
    printf("Petr\n");
  } else {
    printf("Um_nik\n");
  }
  return 0;
}
