#include <bits/stdc++.h>
#pragma GCC optimize("O2")
using namespace std;
const int INF = 1 << 29;
const int MOD = 1e9 + 7;
bool isPowerOfTwo(long long int x) { return x && (!(x & (x - 1))); }
void fastio() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
}
long long binpow(long long a, long long b) {
  long long res = 1;
  while (b > 0) {
    if (b & 1) res = res * a;
    a = a * a;
    b >>= 1;
  }
  return res;
}
const int dx[] = {1, 0, -1, 0, 1, 1, -1, -1};
const int dy[] = {0, -1, 0, 1, 1, -1, -1, 1};
int main() {
  fastio();
  int tc = 1;
  while (tc--) {
    long long int ind = -1;
    char sm = 'z';
    string s;
    cin >> s;
    int n = s.length();
    for (int i = 0; i < (n); i++) {
      sm = min(s[i], sm);
    }
    for (int i = 0; i < (n); i++) {
      if (s[i] == sm) {
        ind = i;
        break;
      }
    }
    sm = 'z';
    for (int i = 0; i < (n); i++) {
      if (i < ind) {
        if (s[i] > sm)
          cout << "Ann";
        else
          cout << "Mike";
      } else if (s[i] == s[ind])
        cout << "Mike";
      else
        cout << "Ann";
      sm = min(sm, s[i]);
      cout << "\n";
      ;
    }
  done:;
  }
  return 0;
}
