#include #include #include #include #define _USE_MATH_DEFINES #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; #define li long long int #define rep(i,to) for(li i=0;i<((li)(to));i++) #define repp(i,start,to) for(li i=(li)(start);i<((li)(to));i++) #define pb push_back #define sz(v) ((li)(v).size()) #define bgn(v) ((v).begin()) #define eend(v) ((v).end()) #define allof(v) (v).begin(), (v).end() #define dodp(v,n) memset(v,(li)n,sizeof(v)) #define bit(n) (1ll<<(li)(n)) #define mp(a,b) make_pair(a,b) #define rin rep(i,n) #define EPS 1e-10 #define ETOL 1e-8 #define MOD 1000000007 #define F first #define S second #define p2(a,b) cout< primes; vector > prime_decomposition(li x){ vector > res; rep(i,sz(primes)){ li cnt=0; while(x%primes[i]==0){ x/=primes[i]; cnt++; } if(cnt>0)res.pb(mp(primes[i], cnt)); } if(x!=1)res.pb(mp(x, 1)); return res; } int main(){ rep(i,1000000)prime[i]=true; prime[0]=prime[1]=false; repp(i,2,1100){ if(prime[i]) for(li j=2; i*j<1000000; j++){ prime[i*j]=false; } } rep(i,1000000)if(prime[i])primes.pb(i); li n; cin>>n; vector > soinsu=prime_decomposition(n); //rep(i,sz(soinsu))p2(soinsu[i].F, soinsu[i].S); li res=0; rep(i,sz(soinsu))res^=soinsu[i].S; cout<<(res>0 ? "Alice" : "Bob")<