#include <bits/stdc++.h>
using namespace std;
const int MaxN = 1e6 + 15;
const int MOD = 1e9 + 7;
const long long INF = 1e18;
int f[MaxN];
int get(int x) {
  int res = 0;
  for (; x >= 0; x &= x + 1, --x) res += f[x];
  return res;
}
void up(int x) {
  for (; x < MaxN; x |= x + 1) ++f[x];
}
int main() {
  ios_base ::sync_with_stdio(false);
  cin.tie(NULL);
  int n;
  cin >> n;
  long long res = 0;
  for (int i = 1; i <= n; ++i) {
    int a;
    cin >> a;
    res += i - 1 - get(a);
    up(a);
  }
  if (res % 2 == (3 * n) % 2)
    cout << "Petr\n";
  else
    cout << "Um_nik\n";
  return 0;
}
