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.io.*;
import java.math.*;
import java.security.*;
import java.text.*;
import java.util.*;
import java.util.concurrent.*;
import java.util.regex.*;

public class Solution 
{
    static int mergeSort(int arr[], int array_size)
    {
        int temp[] = new int[array_size];
        return _mergeSort(arr, temp, 0, array_size - 1);
    }
    static int _mergeSort(int arr[], int temp[], int left, int right)
    {
          int mid, inv_count = 0;
          if (right > left)
          {
            mid = (right + left)/2;
            inv_count  = _mergeSort(arr, temp, left, mid);
            inv_count += _mergeSort(arr, temp, mid+1, right);

            inv_count += merge(arr, temp, left, mid+1, right);
          }
          return inv_count;
    }
    static int merge(int arr[], int temp[], int left, int mid, int right)
    {
          int i, j, k;
          int inv_count = 0;

          i = left;
          j = mid;
          k = left;
          while ((i <= mid - 1) && (j <= right))
          {
            if (arr[i] <= arr[j])
            {
              temp[k++] = arr[i++];
            }
            else
            {
              temp[k++] = arr[j++];
              inv_count = inv_count + (mid - i);
            }
          }
          while (i <= mid - 1)
            temp[k++] = arr[i++];
          while (j <= right)
            temp[k++] = arr[j++];
          for (i=left; i <= right; i++)
            arr[i] = temp[i];

          return inv_count;
    }
    private static final Scanner scanner = new Scanner(System.in);

    public static void main(String[] args) throws IOException 
    {
        BufferedReader in=new BufferedReader(new InputStreamReader(System.in));
        int n=Integer.parseInt(in.readLine());
        int[] per=new int[n];
        String[] l1=in.readLine().trim().split("\\s+");
        for(int i=0;i<n;i++)
        {
            per[i]=Integer.parseInt(l1[i]);
        }
        int answer=mergeSort(per,n);
        int par=3*n-answer;
        if(par%2==0)
        {
             System.out.println("Petr");
        }
        else
        {
             System.out.println("Um_nik");
        }
    }
}