#include <iostream>
#include <cstdint>

using namespace std;

static inline constexpr const uint32_t* prepare(const uint32_t N, const uint32_t M, const pair<uint32_t, uint32_t>* const strings)
{
	uint32_t* flag = new uint32_t[N + 1];
	for (uint32_t i = 1; i <= N; ++i)
		flag[i] = 0;

	for (uint32_t i = 0; i != M; ++i)
	{
		if (strings[i].first < strings[i].second)
			flag[strings[i].first] = 1, flag[strings[i].second] = 2;
		else
			flag[strings[i].first] = 2, flag[strings[i].second] = 1;
	}

	return flag;
}

static inline constexpr const char* solve(const uint32_t N, const uint32_t* const flag)
{
	uint32_t count = 0, stacking_count = 0;
	uint32_t* stack = new uint32_t[N];
	for (uint32_t i = 1; i <= N; ++i)
		switch (flag[i])
		{
		case 0:
			++count;
			break;

		case 1:
			stack[stacking_count] = count;
			++stacking_count;
			count = 0;
			break;

		case 2:
			if ((count & 3) == 2)
			{
				delete[] stack;
				return "Akane";
			}
			count = stack[--stacking_count];
			break;
		}

	delete[] stack;
	if ((count & 3) == 2)
		return "Akane";
	else
		return "Aoi";
}

int main()
{
	cin.tie(nullptr);
	ios::sync_with_stdio(false);

	uint32_t N, M, i;
	cin >> N >> M;
	pair<uint32_t, uint32_t>* strings = new pair<uint32_t, uint32_t>[M];
	for (i = 0; i != M; ++i)
		cin >> strings[i].first >> strings[i].second;

	const uint32_t* const flag = prepare(N, M, strings);
	cout << solve(N, flag) << '\n';
	delete[] strings;
	delete[] flag;
	return 0;
}