题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1564

Play a game

Problem 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 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?   Input 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 Output the winner ("8600" or "ailyanlu") for each input line except the last zero.  No other characters should be inserted in the output.   Sample Input 2 0   Sample Output 8600   从一个n*n棋盘的一角出发，每次移动到相邻的，而且没有经过的格子上。谁不能操作了谁输。  还没走过的格子数为奇数时，先手胜。所以n为偶数，先手胜。 [cpp]  view plain  copy  print ? #include<iostream>   using namespace std;   int main()   {       int n;       while(cin>>n)       {           if(n==0)           break;           if(n%2)           cout<<"ailyanlu"<<endl;           else           cout<<"8600"<<endl;        }       return 0;    }