New Year is Coming! 
ailyanlu is very happy today! and he is playing a chessboard game with 8600. 
The size of the chessboard is n*n. A stone is placed in a corner square. They play alternatively with 8600 having the first move. Each time, player is allowed to move the stone to an unvisited neighbor square horizontally or vertically. The one who can‘t make a move will lose the game. If both play perfectly, who will win the game?

The input is a sequence of positive integers each in a separate line. 
The integers are between 1 and 10000, inclusive,(means 1 <= n <= 10000) indicating the size of the chessboard. The end of the input is indicated by a zero.

Output the winner ("8600" or "ailyanlu") for each input line except the last zero. 
No other characters should be inserted in the output.

ailyanlu

8600   |   We have carefully selected several similar problems for you:  1404 1536 1517 1524 1729 

 1 #include<cstdio>
 2 #include<cstring>
 3 #include<stdlib.h>
 4 #include<algorithm>
 5 using namespace std;
 6 int main()
 7 {
 8     int n;
 9     while(scanf("%d",&n)&&n)
10     {
11         if(n%2==0)
12             printf("8600\n");
13         else
14             printf("ailyanlu\n");
15     }
16     return 0;
17 }