#include <bits/stdc++.h>
class BIT {
 public:
 private:
  long long n;
  std::vector<long long> arr;
  static inline long long lowest_bit(const long long& num) {
    return num & -num;
  }

 public:
  BIT(const long long& _n) : n(_n), arr(std::vector<long long>(_n + 1, 0)) {}
  void add(const long long& index, const long long& value) {
    for (long long i = index; i <= n; i += lowest_bit(i)) arr[i] += value;
  }
  long long sum(const long long& upper_bound) const {
    long long ret = 0;
    for (int i = upper_bound; i >= 1; i -= lowest_bit(i)) ret += arr[i];
    return ret;
  }
  long long sum(const long long& lower_bound,
                const long long& upper_bound) const {
    return sum(upper_bound) - sum(lower_bound - 1);
  }
};
const static long long INF = 0x3f3f3f3f3f3f3f3f;
static inline void setio(void);
int main(void) {
  setio();
  long long n;
  std::cin >> n;
  BIT mybit(n);
  long long inv = 0;
  for (long long val, i = 0; i < n; ++i) {
    std::cin >> val;
    inv += mybit.sum(val, n);
    mybit.add(val, 1);
  }
  if (inv % 2 == n % 2)
    std::cout << "Petr\n";
  else
    std::cout << "Um_nik\n";
  return 0;
}
static inline void setio(void) {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  std::cout.precision(10);
  std::cout << std::fixed;
}
