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.
import java.util.Scanner;

/**
 * Created by jarett on 5/27/18.
 */
public class CF485E {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] p = new int[n+1];
        int[] r = new int[n+1];
        int diff = 0;
        for (int i = 1; i <= n; i++) {
            p[i] = sc.nextInt();
            r[p[i]] = i;
        }

        int swap = 0;
        for (int j = 1; j <= n; j++) {

            if (p[j] != j) {
                int p1 = j;
                int v1 = p[j];
                int p2 = r[j];
                int v2 = p[r[j]];

                //System.out.println(p1 + " " + v1 + " " + p2 + " " + v2 + " " + swap);


                p[j] = j;
                r[j] = j;
                p[p2] = v1;
                r[v1] = p2;
                swap++;
            }
           /* for (int k = 1; k <= n; k++) {
                System.out.print(p[k] + " ");
            }
            System.out.println();
            System.out.println();*/

        }

        if (swap % 2 == (3*n) % 2)
            System.out.println("Petr");
        else
            System.out.println("Um_nik");
    }
}
