#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; typedef long long ll; map , bool> temp; vector memo; bool rec(vector x, int y) { if (temp.find(x) != temp.end()) return temp[x]; if (y == 1) return temp[x]=true; bool ret = false; for (int i = 0; i < x.size(); i++) { for (int j = 1; j <= x[i]; j++) { x[i] -= j; ret = !rec(x, y-j) || ret; x[i] += j; } } // cout << ret << endl; return temp[x]=ret; } int main() { ll n; cin >> n; bool not_prime[20001]; memset(not_prime, false, sizeof(not_prime)); for (ll i = 2; i*i <= n; i++) { for (ll j = i+i; j*j <= n; j+=i) { not_prime[j] = true; } } ll t = n; for (ll i = 2; i*i <= n; i++) { ll cnt = 0; if (not_prime[i]) continue; if (t%i) continue; while (t%i == 0) { cnt++; t /= i; } memo.push_back(cnt); } if (t != 1) memo.push_back(1); // cout << t << endl; // int cnt = 0; // for (int i = 2; i <= 10000; i++) if (!not_prime[i]) cnt++; // cout << cnt << endl; int sum = 0; for (int i = 0; i < memo.size(); i++) sum += memo[i]; // cout << sum << endl; if (rec(memo, sum)) { cout << "Alice" << endl; }else { cout << "Bob" << endl; } }