#include "bits/stdc++.h" using namespace std; typedef long long ll; typedef pair pii; typedef pair pll; const int INF = 1e9; const ll LINF = 1e18; template ostream& operator << (ostream& out,const pair& o){ out << "(" << o.first << "," << o.second << ")"; return out; } template ostream& operator << (ostream& out,const vector V){ for(int i = 0; i < V.size(); i++){ out << V[i]; if(i!=V.size()-1) out << " ";} return out; } template ostream& operator << (ostream& out,const vector > Mat){ for(int i = 0; i < Mat.size(); i++) { if(i != 0) out << endl; out << Mat[i];} return out; } template ostream& operator << (ostream& out,const map mp){ out << "{ "; for(auto it = mp.begin(); it != mp.end(); it++){ out << it->first << ":" << it->second; if(mp.size()-1 != distance(mp.begin(),it)) out << ", "; } out << " }"; return out; } /* 問題文============================================================ ================================================================= 解説============================================================= ================================================================ */ /* 素因数分解 */ vector PrimeFact(ll n){ vector res; while(n!=1){ if(n == 2 || n == 3){ res.emplace_back(n); n/=n; continue; } bool prime_flag = false; for(int i = 2;i*i <= n;i++){ if(n%i==0){ res.emplace_back(i); n/=i; prime_flag = true; break; } } if(!prime_flag){res.emplace_back(n); n/= n;} } return res; } string solve(){ ll N; cin >> N; vector M(N); for(auto& in:M) cin >> in; map mp; ll XOR = 0; for(int i = 0; i < N;i++){ mp.clear(); auto primes = PrimeFact(M[i]); for(auto prime:primes) mp[prime]++; for(auto p:mp){ XOR ^= (p.second%3); } } if(!XOR){ return "Bob"; }else{ return "Alice"; } } int main(void) { cin.tie(0); ios_base::sync_with_stdio(false); cout << solve() << endl; return 0; }