#include<bits/stdc++.h>

using namespace std;

typedef pair<int,int> P;

typedef long long LL;

const int MAX_N = 1e6+;

const int INF =1e9+;

int N,M,T,S;

int vec[MAX_N];

int main(){

    while(cin>>N)

    {

        for(int i=;i<=N;i++) scanf("%d",&vec[i]);

        int num = ;

        for (int i = ; i <= N; i++)

        {

            while (vec[i] != i)

            {

                swap(vec[i], vec[vec[i]]);

                num++;

            }

        }

        if((*N - num) %  == ) cout<<"Petr"<<endl;

        else cout<<"Um_nik"<<endl;

    }

    return ;

}