#include <bits/stdc++.h>
const long long LINF = 1e18;
const int INF = 1e9;
const int M = 1e9 + 7;
const double EPS = 1.0e-9;
const double PI = acos(-1.0);
using namespace std;
map<int, int> m;
int n;
int a[1000100];
int main() {
  std::ios_base::sync_with_stdio(0);
  cin >> n;
  for (int i = 1; i < n + 1; i++) {
    cin >> a[i];
    m[a[i]] = i;
  }
  int cnt = 0;
  for (int i = 1; i < n; i++) {
    if (a[i] != i) {
      int newPos = m[i];
      m[i] = i;
      m[a[i]] = newPos;
      swap(a[i], a[newPos]);
      cnt++;
    }
  }
  int cntP = 3 * n - cnt;
  int cntU = 7 * n + 1 - cnt;
  if (cntP % 2)
    cout << "Um_nik";
  else
    cout << "Petr";
  return 0;
}
