#include using namespace std; #include using namespace atcoder; using ll = long long; using ld = long double; using P = pair; using Graph = vector>; using vi = vector; using vl = vector; using vll = vector; using vvi = vector; using vvl = vector; using vvll = vector; using vs = vector; using vc = vector; using vvc = vector; using pll = pair; using vpll = vector; using mint = modint1000000007; const long double EPS = 1e-18; const long long INF = 1e18; const long double PI = acos(-1.0L); #define reps(i, a, n) for (ll i = (a); i < (ll)(n); i++) #define rep(i, n) for (ll i = (0); i < (ll)(n); i++) #define rrep(i, n) for (ll i = (1); i < (ll)(n + 1); i++) #define repd(i, n) for (ll i = n - 1; i >= 0; i--) #define rrepd(i, n) for (ll i = n; i >= 1; i--) #define ALL(n) begin(n), end(n) #define IN(a, x, b) (a <= x && x < b) #define INIT \ std::ios::sync_with_stdio(false); \ std::cin.tie(0); template inline T CHMAX(T& a, const T b) { return a = (a < b) ? b : a; } template inline T CHMIN(T& a, const T b) { return a = (a > b) ? b : a; } map soinsu(ll N) { ll res = N; map ma; for (ll i = 2; i * i <= N; i++) { while (res % i == 0) { res /= i; ma[i]++; } } if (res != 1) { ma[res]++; } return ma; } int main() { ll N; cin >> N; vll M(N); rep(i, N) { cin >> M[i]; } vll grundy(110, 0); rrep(j, 108) { set se; rrep(i, 2) { if (j >= i) { se.insert(grundy[j - i]); } } ll g = 0; while (se.count(g)) { g++; } grundy[j] = g; } ll game = 0; rep(i, N) { map ma = soinsu(M[i]); for (auto x : ma) { game ^= grundy[x.second]; } } if (game) { cout << "Alice" << endl; } else { cout << "Bob" << endl; } }