#include<iostream>
#include<cstdlib>
#include<string>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<climits>
#include<cmath>
#include<cctype>
#include<stack>
#include<queue>
#include<list>
#include<vector>
#include<set>
#include<map>
#include<sstream>
#include<unordered_map>
using namespace std;
typedef long long LL;
const int inf=0x3f3f3f3f;
const int N=1e5+100;
int main()
{
// freopen("input.txt","r",stdin);
int n;
scanf("%d",&n);
int mmax=0;
int ans=0;
for(int i=1;i<=n;i++)
{
int num;
scanf("%d",&num);
mmax=max(mmax,num);
if(ans==0)
ans=num;
else
ans=__gcd(ans,num);
}
mmax/=ans;
if((mmax-n)&1)
printf("Alice\n");
else
printf("Bob\n");
return 0;
}