Edogawa Conan got tired of solving cases, and invited his friend, Professor Agasa, over. They decided to play a game of cards. Conan has n cards, and the i-th card has a number ai written on it.

They take turns playing, starting with Conan. In each turn, the player chooses a card and removes it. Also, he removes all cards having a number strictly lesser than the number on the chosen card. Formally, if the player chooses the i-th card, he removes that card and removes the j-th card for all j such that aj < ai.

A player loses if he cannot make a move on his turn, that is, he loses if there are no cards left. Predict the outcome of the game, assuming both players play optimally.

Input

The first line contains an integer n (1 ≤ n ≤ 105) — the number of cards Conan has. 

The next line contains n integers a1, a2, ..., an (1 ≤ ai ≤ 105), where ai is the number on the i-th card.

Output

If Conan wins, print "Conan" (without quotes), otherwise print "Agasa" (without quotes).

Examples

Input

3
4 5 7


Output

Conan


Input

2
1 1


Output

Agasa

Note

In the first example, Conan can just choose the card having number 7 on it and hence remove all the cards. After that, there are no cards left on Agasa's turn.

In the second example, no matter which card Conan chooses, there will be one one card left, which Agasa can choose. After that, there are no cards left when it becomes Conan's turn again.
/**
 * Built using Sublime,Custom Python and Batch files
 * @author Siddhraj Sisodiya
 */

import java.io.*;
import java.util.*;
import java.math.*;

public class Main 
{
   public static void main(String[] args)
    {
        InputStream inputStream = System.in;
        InputReader in = new InputReader(inputStream);
        Task solver = new Task(in);
        solver.solve();
    }

    static class Task
    {
        InputReader in;
        int ans[]=new int[1001];
        

        Task(InputReader in)
        {
            this.in=in;
            Arrays.fill(ans,0);
        }

        public void solve()
        {
            int n=in.nextInt();
            int a[]=in.nextIntArray(n);
            Arrays.sort(a);
            int temp=a[n-1];
            int count=0;
            for(int i=n-1;i>=0;i--)
            {
                if(a[i]==temp)
                    count++;
                else
                {
                    if(count%2!=0)
                        break;
                    count=1;
                    temp=a[i];
                }
            }
            if(count%2!=0)
                System.out.println("Conan");
            else
                System.out.println("Agasa");
        }

        private int nCrModp(int n, int r, int p)
{
    // The array C is going to store last row of
    // pascal triangle at the end. And last entry
    // of last row is nCr
    int C[]=new int[r+1];
 
    C[0] = 1; // Top row of Pascal Triangle
 
    // One by constructs remaining rows of Pascal
    // Triangle from top to bottom
    for (int i = 1; i <= n; i++)
    {
        // Fill entries of current row using previous
        // row values
        for (int j = Math.min(i, r); j > 0; j--)
 
            // nCj = (n-1)Cj + (n-1)C(j-1);
            C[j] = (C[j] + C[j-1])%p;
    }
    return C[r];
}

        private int countB(int k)
        {
            int i=1;
            int count=0;
            while(i<=k)
            {
               // System.out.println(i&k);
                if((i&k)!=0)
                    count++;
                i=i<<1;
            }
            return count;
        }


        
        private int noOfop(int k)
        {
            if(k==1)
                return 0;
            if(ans[k]==0)
            {
                ans[k]=noOfop(countB(k))+1;
            }
            return ans[k];
        }
    }

    static class InputReader 
    {
        private boolean finished = false;

        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;
        private SpaceCharFilter filter;

        public InputReader(InputStream stream) 
        {
            this.stream = stream;
        }

        public int read() 
        {
            if (numChars == -1) 
            {
                throw new InputMismatchException();
            }
            if (curChar >= numChars) 
            {
                curChar = 0;
                try 
                {
                    numChars = stream.read(buf);
                } catch (IOException e) 
                {
                    throw new InputMismatchException();
                }
                if (numChars <= 0) 
                {
                    return -1;
                }
            }
            return buf[curChar++];
        }

        public int peek() 
        {
            if (numChars == -1) 
            {
                return -1;
            }
            if (curChar >= numChars) 
            {
                curChar = 0;
                try 
                {
                    numChars = stream.read(buf);
                } catch (IOException e) 
                {
                    return -1;
                }
                if (numChars <= 0) 
                {
                    return -1;
                }
            }
            return buf[curChar];
        }

        public int nextInt() 
        {
            int c = read();
            while (isSpaceChar(c)) 
            {
                c = read();
            }
            int sgn = 1;
            if (c == '-') 
            {
                sgn = -1;
                c = read();
            }
            int res = 0;
            do 
            {
                if (c < '0' || c > '9') 
                {
                    throw new InputMismatchException();
                }
                res *= 10;
                res += c - '0';
                c = read();
            } while (!isSpaceChar(c));
            return res * sgn;
        }

        public long nextLong() 
        {
            int c = read();
            while (isSpaceChar(c)) 
            {
                c = read();
            }
            int sgn = 1;
            if (c == '-') 
            {
                sgn = -1;
                c = read();
            }
            long res = 0;
            do 
            {
                if (c < '0' || c > '9') 
                {
                    throw new InputMismatchException();
                }
                res *= 10;
                res += c - '0';
                c = read();
            } while (!isSpaceChar(c));
            return res * sgn;
        }

        public String nextString() 
        {
            int c = read();
            while (isSpaceChar(c)) 
            {
                c = read();
            }
            StringBuilder res = new StringBuilder();
            do 
            {
                if (Character.isValidCodePoint(c)) 
                {
                    res.appendCodePoint(c);
                }
                c = read();
            } while (!isSpaceChar(c));
            return res.toString();
        }

        public boolean isSpaceChar(int c) 
        {
            if (filter != null) 
            {
                return filter.isSpaceChar(c);
            }
            return isWhitespace(c);
        }

        public static boolean isWhitespace(int c) 
        {
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

        private String readLine0() 
        {
            StringBuilder buf = new StringBuilder();
            int c = read();
            while (c != '\n' && c != -1) 
            {
                if (c != '\r') 
                {
                    buf.appendCodePoint(c);
                }
                c = read();
            }
            return buf.toString();
        }

        public String readLine() 
        {
            String s = readLine0();
            while (s.trim().length() == 0) 
            {
                s = readLine0();
            }
            return s;
        }

        public String readLine(boolean ignoreEmptyLines) 
        {
            if (ignoreEmptyLines) 
            {
                return readLine();
            } else 
            {
                return readLine0();
            }
        }

        public BigInteger readBigInteger() 
        {
            try 
            {
                return new BigInteger(nextString());
            } catch (NumberFormatException e) 
            {
                throw new InputMismatchException();
            }
        }

        public char nextCharacter() 
        {
            int c = read();
            while (isSpaceChar(c)) 
            {
                c = read();
            }
            return (char) c;
        }

        public double nextDouble() 
        {
            int c = read();
            while (isSpaceChar(c)) 
            {
                c = read();
            }
            int sgn = 1;
            if (c == '-') 
            {
                sgn = -1;
                c = read();
            }
            double res = 0;
            while (!isSpaceChar(c) && c != '.') 
            {
                if (c == 'e' || c == 'E') 
                {
                    return res * Math.pow(10, nextInt());
                }
                if (c < '0' || c > '9') 
                {
                    throw new InputMismatchException();
                }
                res *= 10;
                res += c - '0';
                c = read();
            }
            if (c == '.') 
            {
                c = read();
                double m = 1;
                while (!isSpaceChar(c)) 
                {
                    if (c == 'e' || c == 'E') 
                    {
                        return res * Math.pow(10, nextInt());
                    }
                    if (c < '0' || c > '9') 
                    {
                        throw new InputMismatchException();
                    }
                    m /= 10;
                    res += (c - '0') * m;
                    c = read();
                }
            }
            return res * sgn;
        }

        public boolean isExhausted() 
        {
            int value;
            while (isSpaceChar(value = peek()) && value != -1) 
            {
                read();
            }
            return value == -1;
        }

        public String next() 
        {
            return nextString();
        }

        public SpaceCharFilter getFilter() 
        {
            return filter;
        }

        public void setFilter(SpaceCharFilter filter) 
        {
            this.filter = filter;
        }

        public interface SpaceCharFilter 
        {
            public boolean isSpaceChar(int ch);
        }
        public int[] nextIntArray(int n)
        {
            int[] array=new int[n];
            for(int i=0;i<n;++i)array[i]=nextInt();
            return array;
        }
        public int[] nextSortedIntArray(int n)
        {
            int array[]=nextIntArray(n);
            Arrays.sort(array);
            return array;
        }
        public int[] nextSumIntArray(int n)
        {
            int[] array=new int[n];
            array[0]=nextInt();
            for(int i=1;i<n;++i)array[i]=array[i-1]+nextInt();
            return array;
        }
        public long[] nextLongArray(int n)
        {
            long[] array=new long[n];
            for(int i=0;i<n;++i)array[i]=nextLong();
            return array;
        }
        public long[] nextSumLongArray(int n)
        {
            long[] array=new long[n];
            array[0]=nextInt();
            for(int i=1;i<n;++i)array[i]=array[i-1]+nextInt();
            return array;
        }
        public long[] nextSortedLongArray(int n)
        {
            long array[]=nextLongArray(n);
            Arrays.sort(array);
            return array;
        }
    }
}

