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;

public class E {

	static int[] a;
	static int[] pos;
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int n = in.nextInt();
		a = new int[n];
		pos = new int[n+1];
		for(int i = 0; i < n; ++i) {
			a[i] = in.nextInt();
			pos[a[i]] = i;
		}
		int count = 0;
		for(int i = 0; i < n; ++i) {
			if(a[i] != i+1 ) {
				//System.out.println("Swapping positions " + i + " and " + pos[i+1]);	
				swap(i, pos[i+1]);
				//System.out.println("Swapping " + a[i] + " and " + a[pos[i+1]]);
				pos[a[pos[i+1]]] = pos[i+1];
				pos[i+1] = i;
				count++;
			}
		}
		if(count %2 == (3*n)%2) System.out.println("Petr");
		else System.out.println("Um_nik");
		//System.out.println(count);
	}
	
	
	static void swap(int i, int j) {
		a[i] = a[i] ^ a[j];
		a[j] = a[i] ^ a[j];
		a[i] = a[i] ^ a[j];
		
	}

}
