#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <ctype.h>

int pole[100002];

template <typename T>
inline void swap(T& x, T& y)
{
  T tmp = x;
  x = y;
  y = tmp;
}

bool OneTask()
{
  int N;

  scanf("%d", &N);

  if(N == 0) return false;

  for(int i = 1; i <= N; ++i)
    {
      scanf("%d", &pole[i]);
    }

  int i = 1;
  int pocet = 0;

  while(i < N)
    {
      if(pole[i] == i)
	++i;
      else
	{
	  swap(pole[i], pole[pole[i]]);
	  ++pocet;
	}
    }

  if(pocet % 2 == 0)
    printf("Permutaci lze prevest.\n");
  else
    printf("Matfyzacci maji smulu.\n");

  return true;
}

int main()
{
  while(OneTask())
    ;
  
  return 0;
}