#include <bits/stdc++.h>
const int mod = (1e9) + 7;
using namespace std;
int isprime(long long p) {
  for (long long i = p / 2; i >= 2; i--) {
    if (p % i == 0) return 0;
  }
  return 1;
}
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long lcm(long long a, long long b) { return (a * b) / gcd(a, b); }
long long powmod(long long a, long long b) {
  long long res = 1;
  a %= mod;
  for (; b; b >>= 1) {
    if (b & 1) res = res * a % mod;
    a = a * a % mod;
  }
  return res;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  long long t = 1, i = 0, j = 0;
  while (t--) {
    string s;
    cin >> s;
    long long n = s.size();
    long long a[n], cnt;
    cout << "Mike";
    cout << endl;
    char c = s[0];
    for (i = 1; i < n; i++) {
      if (c < s[i])
        cout << "Ann";
      else {
        cout << "Mike";
        c = s[i];
      }
      cout << endl;
    }
  }
}
