#include <stdio.h>

int a[100002];
int prev[100002];
int next[100002];
int last;

void REM(int i)
{
  int p,n;
  p = prev[i];
  n = next[i];
  if (p)
    next[p] = n;
  if (n)
    prev[n] = p;
  else
    last = p;
}

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

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

    last = 0;
    for(i=1; i<=n; i++)
    {
      scanf("%d",&a[i]);
      if (a[i] != i)
      {
	prev[i] = last;
	next[i] = 0;
	if (last)
	  next[last] = i;
	last = i;
      }
    }

    ok = 1;

    while (last)
    {
      i = last;
      j = a[i];
      REM(j);
      if (a[j] != i)
      {
	k = a[j];
	REM(k);
	if (a[k] == i)
	  REM(i);
      }
      else
      {
	k = prev[last];
	if (!k)
	{
	  ok = 0;
	  break;
	}
      }

      l = a[i];
      a[i] = a[k];
      a[k] = a[j];
      a[j] = l;
    }
    
    if (ok)
      printf("Permutaci lze prevest.\n");
    else
      printf("Matfyzacci maji smulu.\n");
  }
  
  return 0;
}