#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; #define rep(i,n) for(int i=0; i<(n); i++) #define FOR(i,x,n) for(int i=x; i<(n); i++) #define vint(a,n) vint a(n); rep(i, n) cin >> a[i]; #define vll(a,n) vll a(n); rep(i, n) cin >> a[i]; #define ALL(n) begin(n),end(n) #define RALL(n) rbegin(n),rend(n) #define MOD (1000000007) // #define MOD (998244353) #define INF (1e9+7) #define INFL (2e18) typedef long long ll; typedef unsigned int ui; typedef unsigned long long ull; using vint=vector; using vll=vector; using vbool=vector; using P=pair; templateusing arr=vector>; templateint popcount(T &a){int c=0; rep(i, 8*(int)sizeof(a)){if((a>>i)&1) c++;} return c;} templatevoid pl(T x){cout << x << " ";} templatevoid pr(T x){cout << x << endl;} template inline void pr(T Tar, Ts... ts) { std::cout << Tar << " "; pr(ts...); return; } templatevoid prvec(vector& a){rep(i, (int)a.size()-1){pl(a[i]);} pr(a.back());} templatevoid prarr(arr& a){rep(i, (int)a.size()) if(a[i].empty()) pr(""); else prvec(a[i]);} templatebool chmax(T &a, const T &b) { if (abool chmin(T &a, const T &b) { if (b void Fill(A (&array)[N], const T &val){fill( (T*)array, (T*)(array+N), val );} template map prime_factorize(T n){ map m; T t = n; while(t!=1 && t%2==0){ m[2]++; t /= 2; } for(T j=3;j*j<=t;j+=2){ while(t!=1 && t%j==0){ m[j]++; t/=j; } } if(t!=1) m[t]++; return m; } int main() { ll n; cin >> n; map m = prime_factorize(n); int s = 0; for(auto p: m){ s ^= p.second; } if(s!=0) pr("Alice"); else pr("Bob"); return 0;}