#include <iostream>
#include <stack>
using namespace std;
int main() {
	int N;
	cin >> N;
	int M;
	cin >> M;
	int count[1000001] = { 0 };
	int point[1000001] = { 0 };
	stack<int>S;
	for (int i = 1;i <= M;i++) {
		int P, Q;
		cin >> P >> Q;
		if (P > Q) {//P<Qとしておきたい
			swap(P, Q);
		}
		point[P] = Q;
		point[Q] = P;
	}
	S.push(0);//番兵
	for (int i = 1;i <= N;i++) {
		if (point[i] == 0) {
			count[S.top()]++;
			continue;
		}
		else if (i < point[i]) {
			S.push(i);
		}
		else {
			S.pop();
		}
	}
	for (int i = 0;i <= N;i++) {
		if (count[i] % 4 == 2) {
			cout << "Akane\n";
			return 0;
		}
	}
	cout << "Aoi";
	return 0;
}