#include <bits/stdc++.h>

using namespace std;

map<long long, int> factorize(long long n) {
  map<long long, int> ret;

  for (long long i = 2; i * i <= n; i++) {
    while (n % i == 0) {
      ++ret[i];
      n /= i;
    }
  }

  if (n != 1)
    ret[n] = 1;

  return ret;
}

int grundy(vector<int> &v) {
  set<int> s;
  for (int i = 0; i < v.size(); i++) {
    if (v[i] >= 1) {
      --v[i];
      s.insert(grundy(v));
      ++v[i];
    }
    if (v[i] >= 2) {
      v[i] -= 2;
      s.insert(grundy(v));
      v[i] += 2;
    } 
  }

  for (int i = 0; ; i++) {
    if (!s.count(i))
      return i;
  }
}

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);

  int n;
  cin >> n;

  int x = 0;
  for (int i = 0; i < n; i++) {
    int m;
    cin >> m;
    auto f = factorize(m);
    vector<int> v;
    for (auto &pr: f)
      v.push_back(pr.second);
    x ^= grundy(v);
  }

  if (x)
    cout << "Alice" << endl;
  else
    cout << "Bob" << endl;
  
  return 0;
}