Play a game

Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1030    Accepted Submission(s): 838

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 Author ailyanlu Source Recommend 8600

從一個n*n的角落出發，每次移動到相鄰的，而且沒有經過的格子上。誰不能操作了誰輸。

結論就是n為偶數，先手贏，奇數，後手贏。

可以看下圖

S表示起點。

如果n為偶數，那麼所有格子可以被2*1的磚塊覆蓋掉。

這樣先手每次都移動到當前1*2的另外一塊。先手必贏。

如果n為奇數。出了起始那個店，其餘點都可以被覆蓋。

所有後手贏

#include <string.h>
#include <stdio.h>
#include <algorithm>
#include <iostream>
using namespace std;
int main()
{
    int n;
    
 
while(scanf("%d",&n)==1 &&n)
    {
        if(n%2==0)printf("8600\n");
        else printf("ailyanlu\n");
    }
    return 0;
}