#include <bits/stdc++.h>
using namespace std;
int main() {
  long long a[100001], n, output, ma;
  map<long long, long long> d;
  cin >> n;
  ma = 0;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    ma = max(ma, a[i]);
    d[a[i]]++;
  }
  sort(a, a + n);
  for (int i = 0; i < n; i++)
    if (d[a[i]] % 2 != 0) {
      cout << "Conan";
      return 0;
    }
  cout << "Agasa";
  return 0;
}
