uva 12293 博弈

#include<cstdio>
#include<cstring>
typedef long long LL;
using namespace std;
LL res[100000],cnt,n;
void init(){
	cnt=1;
	res[0]=3;
	while(1){
		res[cnt]=res[cnt-1]*2+1;
		if(res[cnt]>1000000000)
		break;
		cnt++;
	}
}
int solve(LL x){
	if(x<=1)
	return 0;
	for(int i=0;i<=cnt;i++)
	if(x==res[i])
	return 0;
	return 1;
}
int main(){
	init();
	while(~scanf("%lld",&n)&&n){
		if(solve(n))
		printf("Alice\n");
		else
		printf("Bob\n");
	}
}