#include <bits/stdc++.h>
#pragma GCC omptimize("unroll-loops")
#pragma optimize("SEX_ON_THE_BEACH")
#pragma GCC optimize("no-stack-protector")
#pragma comment(linker, "/STACK:1000000000")
using namespace std;
using ll = long long int;
using ull = unsigned long long int;
using dd = long double;
using ldd = long double;
using si = short int;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
ll get_seed(string s) {
  ll ans = 0;
  for (int i = 0; i < s.size(); ++i) ans += s[i];
  return ans;
}
int popcount(int x) { return __builtin_popcount(x); }
int popcount(ll x) { return __builtin_popcountll(x); }
void solve(int test_number) {
  string in;
  cin >> in;
  int mi = 'z' + 1;
  for (int i = 0; i < in.size(); ++i) {
    if (mi < in[i]) {
      cout << "Ann" << '\n';
    } else {
      cout << "Mike" << '\n';
    }
    mi = min(mi, (int)in[i]);
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cout.tie(0);
  cin.tie(0);
  int t;
  t = 1;
  for (int i = 0; i < t; ++i) solve(i);
  return 0;
}
