#include <bits/stdc++.h>
using namespace std;
int n, d[110005], say, cev = 1;
int enaz = 1000000000, enfaz = 0;
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    scanf("%d", &d[i]);
    enaz = min(enaz, d[i]);
  }
  while (1) {
    int bayrak = 0;
    for (int i = 2; i <= enaz && enaz % i == 0; i++) {
      int bay = 0;
      for (int j = 0; j < n; j++) {
        if (d[j] % i != 0) {
          bay = 1;
          break;
        }
      }
      if (bay == 0) {
        bayrak = 1;
        for (int j = 0; j < n; j++) {
          d[j] = d[j] / i;
        }
        enaz = enaz / i;
        break;
      }
    }
    if (bayrak == 0) break;
  }
  for (int j = 0; j < n; j++) enfaz = max(enfaz, d[j]);
  int cev = 0;
  cev = enfaz - n;
  if (cev % 2 == 1)
    printf("Alice");
  else
    printf("Bob");
}
