#include <bits/stdc++.h>
using namespace std;
int __gcd(int x, int y) {
  if (!y) return x;
  return __gcd(y, x % y);
}
const long long linf = 1e18 + 5;
int mod = (int)1e9;
const int logN = 18;
const int inf = 1e9 + 9;
const int N = 1e5 + 5;
int ff, h[N], n, a[N], x, y, z, p;
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
    h[a[i]]++;
  }
  int ff = 0;
  for (int i = 1; i <= 100000; i++)
    if (h[i] & 1) ff = 1;
  if (ff) {
    cout << "Conan";
  } else
    cout << "Agasa";
  return 0;
}
