#include <stdio.h>

int a[1000000];
int b[1000000];

int main()
{
  int n,i,j,k,l,m, ok;

  while(1)
  {
    scanf("%d",&n);
    if(!n)
      break;

    for(i=1; i<=n; i++)
    {
      scanf("%d",&a[i]);
      b[i] = 1;
    }
    
    m=n;
    ok = 1;

    i = 1;
    while (i <= n)
      if (b[i])
      {
	if (a[i] == i)
	{
	  b[i] = 0;
	  m--;
	  
	}
	else
	{
	  if (m < 3)
	  {
	    ok = 0;
	    break;
	  }
	  else
	  {
	    j = a[i];
	    k = a[j];
	    l = a[i];
	    a[i] = a[k];
	    a[k] = a[j];
	    a[j] = l;
	    b[j] = 0;
	    b[k] = 0;
	    m -= 2;
	  }
	}
      }
      else
	i++;
    
    if (ok)
      printf("Permutaci lze prevest.\n");
    else
      printf("Matfyzacci maji smulu.\n");
  }
  
  return 0;
}