#include <stdio.h>
int calc(int n);

int pole[100000];
int main() {
   int n,k;


   scanf("%d", &n);

   while (n != 0) {
      for (k=0;k<n;k++)
         pole[k]=0;
      if (calc(n) == 1) printf("Permutaci lze prevest.\n");
      else  printf("Matfyzacci maji smulu.\n");

      scanf("%d", &n);
   }

  return 0;
}

int calc(int n) {
   int cislo;
   int bad=0;
   for (int i=0; i<n; i++){
      scanf("%d",&cislo);
      pole[i]++;
      if (pole[i]>1) return 0;
      if (cislo!=(i+1)) bad++;
   }
   if (bad%3)
      return 0;
   else
      return 1;
}