A题博弈论CodeForces - 914B

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 a_i 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 a_j < a_i.

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 ≤ 10⁵) — the number of cards Conan has.

The next line contains n integers a₁, a₂, ..., a_n (1 ≤ a_i ≤ 10⁵), where a_i is the number on the i-th card.

Output

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

Example

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.

每次取但是如果有相同大小多项则必定需要换轮，换的人也可以选择不选来制裁，所以先手制裁后手，但是如果有偶数项一个数必定换人制裁，故检验有没有数是偶数个即可

#include<stdio.h>
int main()
{
    int n,i,num[100005]={0},count[100005]={0};
    scanf("%d",&n);
    for (i=0;i<=n-1;i++)
    {
        scanf("%d",&num[i]);
        count[num[i]]++;
    }
    for (i=0;i<=n-1;i++)
    {
        if (count[num[i]]%2)
        {
            printf("Conan");
            return 0;
        }
    }
    printf("Agasa");
}