#include <bits/stdc++.h>
using namespace std;
namespace FenwickTree {
const int maxn = 1e6;
long long arr[maxn + 5];
void add(int x, int v, int n) {
  for (int i = x; i <= n; i += ((i) & (-(i)))) arr[i] += v;
}
long long sum(int x) {
  long long ans = 0;
  for (int i = x; i > 0; i -= ((i) & (-(i)))) ans += arr[i];
  return ans;
}
}  // namespace FenwickTree
const int maxn = 1e6;
long long res;
int n, a[maxn + 5];
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) scanf("%d", &a[i]);
  for (int i = n; i > 0; --i) {
    res += FenwickTree::sum(a[i]);
    FenwickTree::add(a[i], 1, n);
  }
  long long s = abs(res - n);
  if (s % 2 == 0)
    cout << "Petr\n";
  else
    cout << "Um_nik\n";
  return 0;
}
