Sicily 2683. Alice and Bob

Time Limit: 1 secs, Memory Limit: 256 MB

Description

Bob is very famous because he likes to play games. Today he puts a chessboard in the desktop, and plays a game with Alice. The size of the chessboard is n by n. A stone is placed in a corner square. They play alternatively with Alice 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, indicating the size of the chessboard. The end of the input is indicated by a zero.
Output

Output the winner (“Alice” or “Bob”) for each input line except the last zero. No other characters should be inserted in the output.
Sample Input

2
0
Sample Output

Alice
Problem Source

^_^ May Alice and Bob well for they had to play this foolish game so many times!

#include 

using namespace std;

int main()
{
    int T;
    while (cin >> T && T > 0)
    {
        if (T % 2 == 0)
            cout << "Alice" << endl;
        else
            cout << "Bob" << endl;
    }
    return 0;
}