// #undef LOCAL #ifdef ONLINE_JUDGE #pragma GCC optimize("Ofast") #pragma GCC optimize("unroll-loops") #endif #ifdef LOCAL // #define _GLIBCXX_DEBUG #include "../algo/debug.hpp" #else #define debug(...) void(0) #endif #include using namespace std; #if __has_include() #include // using namespace atcoder; #endif constexpr int inf = (1<<30) - 1; constexpr long long linf = (1LL<<60) - 1; using ll = long long; using ld = long double; #define len(x) int((x).size()) #define all(x) begin(x), end(x) #define rall(x) rbegin(x), rend(x) #define LB(c, x) distance(begin(c), lower_bound(all(c), x)) #define UB(c, x) distance(begin(c), upper_bound(all(c), x)) template ll binary_search(F check, ll ok, ll ng, bool CHECK = true) { if(CHECK) assert(check(ok)); while(abs(ok - ng) > 1) { ll mi = (ok + ng) / 2; (check(mi) ? ok : ng) = mi; } return ok; } template auto min(const T& a, const S& b) { return(a < b ? a : b); } template auto max(const T& a, const S& b) { return(a > b ? a : b); } template inline bool chmax(T& a, const S& b) { return(a < b ? a = b, 1 : 0); } template inline bool chmin(T& a, const S& b) { return(a > b ? a = b, 1 : 0); } // ------------------------------------------------------------------ void solve() { ll n; cin >> n; vector> factor; for(ll x = 2; x * x <= n; x++) { if(n % x == 0) { factor.push_back({x, 0}); while(n % x == 0) { factor.back().second++; n /= x; } } } if(n != 1) factor.push_back({n, 1}); ll sm = 0; for(auto&&[x, cnt]: factor) { sm ^= cnt; } if(sm == 0) { cout << "Bob" << endl; }else { cout << "Alice" << endl; } } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); // fixed(cout).precision(12); int T = 1; // cin >> T; while(T--) { solve(); } }