#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const long long dx[4] = {-1, 1, 0, 0};
const long long dy[4] = {0, 0, -1, 1};
long long gcd(long long a, long long b) { return (b == 0 ? a : gcd(b, a % b)); }
long long n, m, k, l, y, x, z = 0, res = 0, ans = 0;
string s;
bool ok;
const int N = 1e6;
long long tab2[1000005];
void solve() {
  cin >> n;
  ans = 0;
  vector<long long> v;
  for (int i = 1; i <= n; ++i) {
    cin >> x;
    long long res = 0;
    long long tmpx = x;
    for (x = x; x > 0; x = x - (x & -x)) res += tab2[x];
    ans = ans + i - res - 1;
    for (tmpx = tmpx; tmpx <= n; tmpx = tmpx + (tmpx & (-tmpx))) tab2[tmpx]++;
  }
  if (n % 2 == 1) {
    if (ans % 2 == 1) {
      cout << "Petr";
    } else {
      cout << "Um_nik";
    }
    return;
  }
  if (ans % 2 == 1) {
    cout << "Um_nik";
  } else {
    cout << "Petr";
  }
  return;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cout << fixed << setprecision(6);
  int t = 1;
  while (t--) solve();
  return 0;
}
