******************************************************************************************************************************************************************************************
解题思路:
Alice先手,棋盘总共有n*n个格子,第一次棋子放在左上角,棋盘剩余n*n-1个棋子,如果剩余棋子个数是奇数个,先手必胜,反之后手必胜
下面附上ac代码
#include <iostream>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <string>
#include <queue>
using namespace std;
typedef long long ll;
#define M 1000000
int num[15]={2,4,8,16,32,64,128,256,512,1024,2048,4096,8192,16384,32768};
int main()
{
std::ios::sync_with_stdio(false);
cin.tie(0),cout.tie(0);
ll t,n,m,p;
//cin>>t;
while(cin>>n&&n)
{
if((n*n-1)%2==0)
cout<<"Bob"<<endl;
else
cout<<"Alice"<<endl;
}
return 0;
}