Problem: Mike and Ann are sitting in the classroom. The lesson is boring, so they decided to play an interesting game. Fortunately, all they need to play this game is a string s and a number k (0 ≤ k < |s|).

At the beginning of the game, players are given a substring of s with left border l and right border r, both equal to k (i.e. initially l=r=k). Then players start to make moves one by one, according to the following rules:

  * A player chooses l^{\prime} and r^{\prime} so that l^{\prime} ≤ l, r^{\prime} ≥ r and s[l^{\prime}, r^{\prime}] is lexicographically less than s[l, r]. Then the player changes l and r in this way: l := l^{\prime}, r := r^{\prime}.
  * Ann moves first.
  * The player, that can't make a move loses.



Recall that a substring s[l, r] (l ≤ r) of a string s is a continuous segment of letters from s that starts at position l and ends at position r. For example, "ehn" is a substring (s[3, 5]) of "aaaehnsvz" and "ahz" is not.

Mike and Ann were playing so enthusiastically that they did not notice the teacher approached them. Surprisingly, the teacher didn't scold them, instead of that he said, that he can figure out the winner of the game before it starts, even if he knows only s and k.

Unfortunately, Mike and Ann are not so keen in the game theory, so they ask you to write a program, that takes s and determines the winner for all possible k.

Input

The first line of the input contains a single string s (1 ≤ |s| ≤ 5 ⋅ 10^5) consisting of lowercase English letters.

Output

Print |s| lines.

In the line i write the name of the winner (print Mike or Ann) in the game with string s and k = i, if both play optimally

Examples

Input


abba


Output


Mike
Ann
Ann
Mike


Input


cba


Output


Mike
Mike
Mike

Solution (in PYTHON3):

Solution:
from collections import Counter as C,defaultdict as D,deque as Q
from operator import itemgetter as I
from itertools import product as P,permutations as PERMUT
from bisect import bisect_left as BL,bisect_right as BR,insort as INSORT
from heapq import heappush as HPUSH,heappop as HPOP
from math import floor as MF,ceil as MC, gcd as MG,factorial as F,sqrt as SQRT, inf as INFINITY,log as LOG
from sys import stdin, stdout
INPUT=stdin.readline
PRINT=stdout.write
L=list;M=map

def Player1():
	print("Mike")

def Player2():
	print("Ann")

def Yes():
	PRINT("Yes\n")

def No():
	PRINT("No\n")

def IsPrime(n):

	for i in range(2,MC(SQRT(n))+1):
		if n%i==0:
			return False
	return True

def Factors(x):

	ans=[]

	for i in range(1,MC(SQRT(x))+1):
		if x%i==0:
			ans.append(i)
			if x%(x//i)==0:
				ans.append(x//i)
	return ans
def CheckPath(source,destination,g):
	visited=[0]*101
	q=Q()
	q.append(source)
	visited[source]=1
	while q:
		node=q.popleft()
		if node==destination:
			return 1
		for v in g[node]:
			if not visited[v]:
				q.append(v)
				visited[v]=1
	return 0
def Sieve(n):
	prime=[1]*(n+1)
	p=2
	while p*p<=n:
		if prime[p]:
			for i in range(p*p,n+1,p):
				prime[i]=0
		p+=1
	primes=[]
	for p in range(2,n+1):
		if prime[p]:
			primes.append(p)
	return primes

def Prefix(a,n):
	p=[]
	for i in range(n):
		if i==0:
			p.append(a[0])
		else:
			p.append(p[-1]+a[i])
	return p
def Suffix(a,n):
	s=[0]*n
	for i in range(n-1,-1,-1):
		if i==n-1:
			s[i]=a[i]
		else:
			s[i]=s[i+1]+a[i]
	return s
def Spf(n):
	spf=[0 for i in range(n)]
	spf[1]=1
	for i in range(2,n):
		spf[i]=i
	for i in range(4,n,2):
		spf[i]=2
	for i in range(3,MC(SQRT(n))+1):
		if spf[i]==i:
			for j in range(i*i,n,i):
				if spf[j]==j:
					spf[j]=i
	return spf

def DFS(g,s,visited,ans):
	visited[s]=1
	
	for u,c in g[s]:

		if visited[u]:
			continue

		if c==ans[s]:

			if c==1:
				ans[u]=2
			else:
				ans[u]=1
		else:
			ans[u]=c
		DFS(g,u,visited,ans)


def lcm(a,b):

	return (a*b)//(MG(a,b))
def Kadane(numbers):

	max_so_far=-INFINITY
	max_ending_here=0
	max_element=-INFINITY
	for i in range(len(numbers)):
		max_ending_here=max(max_ending_here+numbers[i],0)
		max_so_far=max(max_ending_here,max_so_far)
		max_element=max(max_element,numbers[i])
	if max_so_far==0:
		max_so_far=max_element
	return max_so_far


def subset(start,a,res,ans):
	res.append(ans)
	for i in range(start,9):
		subset(i+1,a,res,ans+[a[i]])


def Main():

	string=INPUT();n=len(string)-1
	check=[-1]*n
	s=set();s.add(string[0])
	Player1()
	for i in range(1,n):

		for v in s:
			if v<string[i]:
				check[i]=1
				break
		if check[i]!=-1:
			Player2()
		else:
			Player1()
		s.add(string[i])







Main()

'mysql -u root -p'