#include using namespace std; #include using namespace atcoder; using ll = long long; ll n; vector prime_factor(long long n){ vector res; for(long long i = 2;i*i <= n;i++){ while(n%i==0){ res.push_back(i); n/=i; } } if(n!=1)res.push_back(n); return res; } void solve(){ auto v = prime_factor(n); map mp; for(auto &i:v)mp[i]++; ll x = 0; for(auto &[l,r]:mp){ x ^= r; } if(x)cout<<"Alice"<> n; solve(); }