#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, a, mas_a[100000] = {0}, max = 1;
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> a;
    if (a > max) {
      max = a;
    }
    mas_a[a]++;
  }
  bool found = false;
  while ((max > 0) && !(found)) {
    if ((mas_a[max] % 2) && (mas_a[max] != 0)) {
      found = true;
    }
    max--;
  }
  if (found)
    cout << "Conan";
  else
    cout << "Agasa";
  return 0;
}
