#include <bits/stdc++.h>
using namespace std;
template <class T>
void print(T a) {
  for (auto x : a) cout << x << ' ';
  cout << endl;
}
template <class T, class U>
inline istream& operator>>(istream& str, pair<T, U>& p) {
  return str >> p.first >> p.second;
}
template <class T, class U>
inline ostream& operator<<(ostream& str, pair<T, U>& p) {
  return str << p.first << ' ' << p.second;
}
auto random_address = [] {
  char* p = new char;
  delete p;
  return uint64_t(p);
};
const uint64_t SEED = chrono::steady_clock::now().time_since_epoch().count() *
                      (random_address() | 1);
mt19937_64 rng(SEED);
const long long MOD = 1e9 + 7;
long long add(long long a, long long b) { return (a + b) % MOD; }
long long mul(long long a, long long b) { return (a * b) % MOD; }
long long bin_pow(long long a, long long p) {
  if (!p) return 1;
  if (p == 1) return a;
  long long ans = bin_pow(mul(a, a), p / 2);
  if (p & 1) ans = mul(ans, a);
  return ans;
}
vector<long long> fact;
long long get_c(long long n, long long k) {
  long long v1 = fact[n];
  long long v2 = mul(fact[k], fact[n - k]);
  long long v3 = bin_pow(v2, MOD - 2);
  return mul(v1, v3);
}
template <class T>
struct Fenwick {
  vector<T> t;
  Fenwick(long long n) { t.assign(n, 0); }
  void add(long long x, long long d) {
    for (; x <= t.size() - 1; x += x & -x) t[x] += d;
  }
  long long get(long long x) {
    long long ans = 0;
    for (; x > 0; x -= x & -x) ans += t[x];
    return ans;
  }
  long long rsq(long long l, long long r) { return get(r) - get(l - 1); }
};
void solve() {
  long long n;
  cin >> n;
  vector<long long> a(n);
  for (long long i = 0; i < n; i++) cin >> a[i];
  Fenwick<long long> tr(n + 2);
  long long ans = 0;
  for (long long i = n - 1; i >= 0; i--) {
    ans += tr.get(a[i]);
    tr.add(a[i], 1);
  }
  if ((ans & 1) == ((3 * n) & 1))
    cout << "Petr" << '\n';
  else
    cout << "Um_nik" << '\n';
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long t = 1;
  for (long long i = 0; i < t; i++) {
    solve();
  }
  return 0;
}
