Petr likes to come up with problems about randomly generated data. This time problem is about random permutation. He decided to generate a random permutation this way: he takes identity permutation of numbers from $1$ to $n$ and then $3n$ times takes a random pair of different elements and swaps them. Alex envies Petr and tries to imitate him in all kind of things. Alex has also come up with a problem about random permutation. He generates a random permutation just like Petr but swaps elements $7n+1$ times instead of $3n$ times. Because it is more random, OK?!

You somehow get a test from one of these problems and now you want to know from which one.


-----Input-----

In the first line of input there is one integer $n$ ($10^{3} \le n \le 10^{6}$).

In the second line there are $n$ distinct integers between $1$ and $n$ — the permutation of size $n$ from the test.

It is guaranteed that all tests except for sample are generated this way: First we choose $n$ — the size of the permutation. Then we randomly choose a method to generate a permutation — the one of Petr or the one of Alex. Then we generate a permutation using chosen method.


-----Output-----

If the test is generated via Petr's method print "Petr" (without quotes). If the test is generated via Alex's method print "Um_nik" (without quotes).


-----Example-----
Input
5
2 4 5 1 3

Output
Petr



-----Note-----

Please note that the sample is not a valid test (because of limitations for $n$) and is given only to illustrate input/output format. Your program still has to print correct answer to this test to get AC.

Due to randomness of input hacks in this problem are forbidden.

Difficulty: competition

Starter code:

Solutions:
n = int(input())
l = [int(x) - 1 for x in input().split()]
parity = 0
explore = set(l)
while len(explore) > 0:
    x = explore.pop()
    tmp = x
    found = [x]
    while l[tmp] != x:
        tmp = l[tmp]
        found.append(tmp)
    for i in found[1:]:
        explore.remove(i)
    parity ^= (len(found) - 1) % 2

if parity == n % 2:
    print("Petr")
else:
    print("Um_nik")

import random
astr=input()
N=int(astr)
s=input()
sk=s.split(' ')
ml=[int(i) for i in sk]
kl=[0 for i in ml]
#for i in range(0, 7*N+2):
#    A=random.randint(0,N-1)
#    B=A
#    while(A==B):
#        B=random.randint(0,N-1)
#    swap=ml[A]
#    ml[A]=ml[B]
#    ml[B]=swap
#print(ml)
k=0
for i in range(0,N):
    if kl[i]==0:
        kl[i]=1
        j=ml[i]
        k=k+1
        while(kl[j-1]==0):
            kl[j-1]=1
            j=ml[j-1]

if k%2==0: print("Petr")
else: print("Um_nik")
        


n=int(input())
a=[0]+list(map(int,input().split()))
ans=0
for i in range(1,len(a)):
    if a[i]==-1:
        continue
    j=i
    while a[j]!=-1:
        prev=j
        j=a[j]
        a[prev]=-1
    ans+=1
if n%2==0:
    #n even ans also even even number of swaps required
    #3*n 
    if ans%2==0:
        print("Petr")
    else:
        print("Um_nik")
else:
    #n us odd ans is even odd number of swaps required
    if ans%2==0:
        print("Petr")
    else:
        print("Um_nik")

n=int(input())
a=[0]+list(map(int,input().split()))
ans=0
for i in range(1,len(a)):
    if a[i]==-1:
        continue
    j=i
    while a[j]!=-1:
        prev=j
        j=a[j]
        a[prev]=-1
    ans+=1
if n%2==0:
    #n even ans also even even number of swaps required
    #3*n 
    if ans%2==0:
        print("Petr")
    else:
        print("Um_nik")
else:
    #n us odd ans is even odd number of swaps required
    if ans%2==0:
        print("Petr")
    else:
        print("Um_nik")

import random
n = int(input())
a = list(map(int,input().split(' ')))
c = 0 
for i in range(1,n+1):
    if a[i-1]==i:
        c += 1

if c >= n//1000:
    print("Petr")
else:
    print("Um_nik")


input()
a=list(map(int,input().split()))
n=len(a)
u=n
for i in range(n):
	j=i
	k=0
	while a[j]>0:
		k+=1
		t=j
		j=a[j]-1
		a[t]=0
	if k>0:
		u+=1-k%2
s='Petr'
if u%2>0:
	s='Um_nik'
print(s)


n=int(input())
a=list(map(int,input().split()))
if sum(a[i]==i+1 for i in range(n))>=n//1000:print("Petr")
else:print("Um_nik")



# Made By Mostafa_Khaled


import sys

n = int(sys.stdin.readline().rstrip())
nums = list(map(int, sys.stdin.readline().split()))

swaps = 0
visited = set()
for index in range(n):
    if index in visited:
        continue
    else:
        visited.add(index)
        length = 0
        value = nums[index]
        while (value != index + 1):            
           visited.add(value - 1)
           value = nums[value - 1]
           length += 1
        swaps += length

if ((3 * n - swaps) % 2):
    print("Um_nik")
else:
    print("Petr")






n=int(input())
a=[0] + list(map(int,input().split()))
d={}
for i in range(1,n+1):
    d[a[i]]=i
ans=0
for i in range(1,n+1):
    if a[i]!=i:
        ind1=d[a[i]]
        ind2=d[i]
        va1=a[i]
        val2=i
        a[ind1],a[ind2]=a[ind2],a[ind1]
        d[i]=i
        d[va1]=ind2
        ans+=1
        
    # print(a,ans,d)    
# print(ans)
if (3*n - ans)%2==0:
    print("Petr")
else:
    print("Um_nik")
    


from sys import stdin

n = int(stdin.readline())

p = [int(x)-1 for x in stdin.readline().split()]

visited = [False for x in range(n)]

loops = []

for x in range(n):
    if not visited[x]:
        visited[x] = True
        start = x
        l = [x]
        cur = p[x]
        while cur != start:
            visited[cur] = True
            l.append(cur)
            cur = p[cur]
        loops.append(len(l)-1)


tot = sum(loops)

if n % 2 == 1:
    if tot % 2 == 1:
        print('Petr')
    else:
        print('Um_nik')
else:
    if tot % 2 == 0:
        print('Petr')
    else:
        print('Um_nik')


n = int(input())
l = list(map(int, input().split()))
c = 1
ans = 0
vis = [0] * 1000005
for i in range(n):
    p = i
    vis[i + 1] = 1
    while vis[l[p]] != 1:
        ans -= -1
        vis[l[p]] = 1
        p = l[p] - 1
if 3 * n % 2 == ans % 2: print("Petr")
else: print("Um_nik")