題目：

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是奇數還是偶數就可以了。

參考程式碼：

#include <iostream>
using namespace std;
void judge(int n) {
    if (n % 2 == 0) cout << "8600" << endl;
    else cout << "ailyanlu" << endl;
}
int main() {
    int n;
    while (cin >> n && n) {
        judge(n);
    }
    return
 
 0;
}