#include <bits/stdc++.h>
using namespace std;
int dp[100005][2], n, counter = 0;
vector<int> v;
int dfs(int i, int turn) {
  if (i == n) {
    if ((turn + counter) % 2) return 1;
    return 0;
  }
  if (dp[i][turn] != -1) return dp[i][turn];
  return dp[i][turn] = max(dfs(i + 1, (turn + 1) % 2), dfs(i + 1, turn));
}
int main() {
  std::cin.tie(0);
  std::ios::sync_with_stdio(false);
  cin >> n;
  int x;
  map<int, int> maap;
  for (int i = 0; i < n; i++) {
    cin >> x;
    maap[x * -1]++;
  }
  for (map<int, int>::iterator it = maap.begin(); it != maap.end(); it++) {
    if (it->second % 2) {
      cout << "Conan" << endl;
      return 0;
    }
  }
  cout << "Agasa" << endl;
  return 0;
}
