from collections import deque
N,M=map(int,input().split())
In=[0]*(N+1)
OUT=[0]*(N+1)
for _ in range(M):
    P,Q=map(int,input().split())
    P,Q=min(P,Q),max(P,Q)
    In[P]=1
    OUT[Q]=1

def ok(n):
    return n%4==2

if M==0:
    if ok(N):
        print('Akane')
    else:
        print('Aoi')
    exit()

dq = []
dq.append(N+1)
ans = [0]*(N+2)
for i in range(1,N+1):
    if In[i] == 1:
        dq.append(i)
    elif OUT[i] == 1:
        dq.pop()
    else:
        ans[dq[-1]] += 1
for a in ans:
    if ok(a):
        print('Akane')
        exit()
print('Aoi')