#include <bits/stdc++.h>   using namespace std;   int n, arr[100], res, maxi, mini, g;   int gcd(int a, int b) {     for (; b != 0; b = b % a) swap(a, b);     return a;   }   int main() {     scanf( %d , &n);     for (int i = 0; i < n; i++) scanf( %d , &arr[i]);     maxi = g = arr[0];     for (int i = 0; i < n; i++) {       maxi = max(maxi, arr[i]);       mini = min(mini, arr[i]);       g = gcd(g, arr[i]);     }     res = (maxi / g) - n;     if (res & 1)       printf( Alice );     else       printf( Bob );   }   