#include <bits/stdc++.h>
using namespace std;
long long int pow_mod(long long int a, long long int b) {
  long long int res = 1;
  while (b != 0) {
    if (b & 1) {
      res = (res * a) % 1000000007;
    }
    a = (a * a) % 1000000007;
    b /= 2;
  }
  return res;
}
void solve() {
  string s;
  cin >> s;
  int arr[26] = {0};
  for (long long int i = 0; i < s.size(); i++) {
    int a = (int)(s[i] - 'a');
    bool f = false;
    for (long long int j = 0; j < a; j++) {
      if (arr[j]) {
        f = true;
        break;
      }
    }
    if (f)
      cout << "Ann\n";
    else
      cout << "Mike\n";
    arr[a] = 1;
  }
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long int t;
  t = 1;
  while (t--) solve();
  return 0;
}
