#include <iostream>
#define MOC 100000

int a[MOC], visit[MOC], n, ak, delka, parity;

int main() {

  while (1) {
    cin >> n;
    if (n==0) break;
    for (int i=0; i<n; i++) {
      cin >> a[i];
      visit[i] = 0;
    }
    ak =0;
    parity = 0;
    while (ak < n) {
      delka = 0;
      int start = ak;
      do {
	ak = a[ak] - 1;
	delka ++;
	visit[ak] = 1;
      } while (ak != start);
      if (delka % 2 == 0 ) parity++;
      while (visit[ak] && ak<n) ak++;
    }
    if (parity%2==0) cout << "Permutaci lze prevest." << endl; else cout << "Matfyzacci maji smulu." <<endl;
  }
  return 0;
}