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 JAVA):

Solution:

import java.io.*;
import java.lang.reflect.Array;
import java.math.BigInteger;
import java.util.*;

public class Contest {

    final boolean ONLINE_JUDGE = System.getProperty("ONLINE_JUDGE") != null;
    BufferedReader in;
    PrintWriter out;
    StringTokenizer tok = new StringTokenizer("");

    public static void main(String[] args) {
        new Contest().run();
    }

    void init() throws FileNotFoundException {
        if (ONLINE_JUDGE) {
            in = new BufferedReader(new InputStreamReader(System.in));
            out = new PrintWriter(System.out);
        } else {
            in = new BufferedReader(new FileReader("input.txt"));
            out = new PrintWriter("output.txt");
        }
    }

    String readString() throws IOException {
        while (!tok.hasMoreTokens()) {
            tok = new StringTokenizer(in.readLine());
        }
        return tok.nextToken();
    }

    int readInt() throws IOException {
        return Integer.parseInt(readString());
    }

    long readLong() throws IOException {
        return Long.parseLong(readString());
    }

    double readDouble() throws IOException {
        return Double.parseDouble(readString());
    }

    public void run() {
        try {
            long t1 = System.currentTimeMillis();
            init();
            solve();
            out.close();
            long t2 = System.currentTimeMillis();
            System.err.println("Time(ms) = " + (t2 - t1));
        } catch (Exception e) {
            e.printStackTrace(System.err);
            System.exit(-1);
        }
    }

    class MyComparator implements Comparable<MyComparator> {

        int x;
        int y;

        public MyComparator(int x, int y) {
            this.x = x;
            this.y = y;
        }

        @Override
        public int compareTo(MyComparator a) {
            if (x == a.x) {
                return (y - a.y);
            }
            return x - a.x;
        }
    }

    public static boolean isPrime(int num) {
        if (num > 2 && num % 2 == 0) {
            //System.out.println(num + " is not prime");
            return false;
        }
        int top = (int) Math.sqrt(num) + 1;
        for (int i = 3; i < top; i += 2) {
            if (num % i == 0) {
                //System.out.println(num + " is not prime");
                return false;
            }
        }
        //System.out.println(num + " is prime");
        return true;
    }

    private static int lowerBound(int[] a, int low, int high, int element) {
        while (low < high) {
            int middle = low + (high - low) / 2;
            if (element > a[middle]) {
                low = middle + 1;
            } else {
                high = middle;
            }
        }
        return low;
    }

    private static int upperBound(int[] a, int low, int high, int element) {
        while (low < high) {
            int middle = low + (high - low) / 2;
            if (a[middle] > element) {
                high = middle;
            } else {
                low = middle + 1;
            }
        }
        return low;
    }
    
    public void solve() throws IOException {
        String s = readString();
        char[] split = s.toCharArray();
        //String[] split = s.split("");
        int size = split.length;
        boolean[] result = new boolean[size];
        result[0] = false;
        int min = split[0];
        for(int i=1; i< size; i++) {
            if(split[i] > min) {
                result[i] = true;
            } else {
                result[i] = false;
                min = split[i];
            }
        }
        
        StringBuilder builder = new StringBuilder();
        for(int i=0; i<size; i++) {
            if(result[i]) {
                builder.append("Ann\n");
                //System.out.println("Ann");
            } else {
                builder.append("Mike\n");
                //System.out.println("Mike");
            }
        }
        System.out.println(builder);
        
    }

    public void solveB() throws IOException {
        int n = readInt();
        int[][] matrix = new int[n][n];
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                matrix[i][j] = readInt();
            }
        }

        long ab = matrix[0][1];
        long bc = matrix[1][2];
        long ac = matrix[0][2];
        long a = (long) Math.sqrt( ab*ac / bc);
        //System.out.println(a);
        int aInt = (int) Math.round(a);
        matrix[0][0] = aInt;

        for(int i=1; i<n; i++) {
            matrix[i][i] = matrix[0][i]/aInt;
        }
        //a*b=4; 
        //b*c=6; 
        //a*c =12;
       /* for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                System.out.print(matrix[i][j]);
                if (j != n - 1) {
                    System.out.print(" ");
                }
            }
            System.out.println("");
        }*/

       StringBuilder builder = new StringBuilder();
       for(int i=0; i<n; i++) {
           builder.append(matrix[i][i]).append(" ");
       }
       builder.setLength(builder.length()-1);
       System.out.println(builder);
    }

    public void solveA() throws IOException {

        int n = readInt();
        String s = readString();
        String[] split = s.split("");
        int zero = 0;
        int one = 0;
        for (int i = 0; i < n; i++) {
            if (split[i].equals("r")) {
                zero++;
            } else if (split[i].equals("n")) {
                one++;
            }
        }
        StringBuilder builder = new StringBuilder();
        for (int i = 0; i < one; i++) {
            builder.append("1 ");
        }
        for (int i = 0; i < zero; i++) {
            builder.append("0 ");
        }
        builder.setLength(builder.length() - 1);
        //builder.append("\n");
        System.out.println(builder);
    }

    /**
     *
     * @param a
     * @param b
     * @return
     */
    private BigInteger lcm(BigInteger a, BigInteger b) {
        return a.multiply(b.divide(a.gcd(b)));
    }

}