#include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <complex>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <bitset>
#include <ctime>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <cassert>
#include <cstddef>
#include <iomanip>
#include <numeric>
#include <tuple>

#define REP(i,n) for(long (i)=0;(i)<(n);(i)++)
#define FOR(i,a,b) for(long (i)=(a);(i)<(b);(i)++)
#define RREP(i,a) for(long (i)=(a)-1;(i)>=0;(i)--)
#define FORR(i,a,b) for(long (i)=(a)-1;(i)>=(b);(i)--)
#define MOD 1000000007
#define PI acos(-1.0)
#define DEBUG(C) cout<<C<<endl;
#define PII pair<int,int>
#define PLL pair<long,long>
#define ALL(a) (a).begin(),(a).end()
#define SORT(a) sort((a).begin(),(a).end())
#define RSORT(a) sort((a).begin(),(a).end(),greater<int>())

typedef long long LL;
typedef unsigned long long ULL;

using namespace std;

class myclass{
public:
    void func(){}
};

int calc(int a,int n){
	int cnt=0;
	while(a%n==0){
		cnt++;
		a/=n;
	}
	return cnt;
}

int main(void){
	int N; cin>>N;
	int ans=0;
	for(int i=2;i*i<=N;i++){
		if(N%i==0){
			int cnt=0;
			while(N%i==0){
				cnt++;
				N/=i;
			}
			ans^=cnt;
		}
	}
	if(N!=1) ans^=1;
	if(ans) cout<<"Alice"<<endl;
	else cout<<"Bob"<<endl;
    return 0;
}