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} ≤ n ≤ 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.
def read():
    return int(input())


def readmap():
    return map(int, input().split())


def readlist():
    return list(map(int, input().split()))


N = read()
P = readlist()


def is_even(P):
    checked = [False] * (N+1)
    # numset = {}
    # for n in range(1, N+1):
    #     numset[n] = n

    num_of_even_cycles = 0
    for n in range(1, N+1):
        if checked[n]:
            continue

        checked[n] = True
        len_cyc = 1
        nxt = P[n-1]

        while not checked[nxt]:
            checked[nxt] = True
            nxt = P[nxt-1]
            len_cyc += 1

        if len_cyc % 2 == 0:
            num_of_even_cycles += 1

    # while numset:
    #     flag = False
    #     for n in numset.keys():
    #         if flag:
    #             break
    #         flag = True
    #         length_of_cycle = 1
    #         while P[n-1] in numset:
    #             length_of_cycle += 1
    #             del numset[n]
    #             n = P[n-1]
    #
    #         if length_of_cycle % 2 == 0:
    #             num_of_even_cycles += 1

    if num_of_even_cycles % 2 == 0:
        return True
    else:
        return False


if N % 2 == 0:
    if is_even(P):
        print("Petr")
    else:
        print("Um_nik")
else:
    if not is_even(P):
        print("Petr")
    else:
        print("Um_nik")
