Description
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 has the first move. Each time, player was allowed to move the stone to an unvisited neighbor square horizontally or vertically. The one can ' t make a move would lose the game. If both play perfectly, who would win the game?
Input
The input is a sequence of positive integers, each with a separate line.
The integers is 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
Output the winner ("8600" or "Ailyanlu") for each input line except the last zero.
No other characters should is inserted in the output.
Sample Input
20
Sample Output
8600
1#include <stdio.h>2#include <iostream>3 using namespacestd;4 intMain ()5 {6 intN;7 while(cin>>n&&N)8 {9 if(n%2==0) cout<<"8600"<<Endl;Ten Elsecout<<"Ailyanlu"<<Endl; One } A return 0; -}
HDU 1564 Play a game