#include<cstdio>
#include<queue>
#include<utility>
#include<cstring>
#include<stack>
#include<algorithm>
#include<cmath>
#include<iostream>
#include<map>
#define MAX_N 100001
#define INF 2147483647
#define REP(i,n) for(int i=0;i<(int)(n);i++)
void init(int n);
int find(int n);
void unite(int x,int y);
bool same(int x, int y);
int dx[4] = {1,0,0,-1};
int dy[4] = {0,1,-1,0};
using namespace std;
typedef long long int ll;
struct edge{
  int from,to,cost;
};
typedef vector<vector<edge> > AdjList;
AdjList graph;
typedef pair<int , int> P;
bool comp(const edge& e1, const edge& e2){
  return e1.cost < e2.cost;
}
int E,V;
edge es[100001];
int kruskal(){
  sort(es,es+E,comp);
  init(V);
  int res = 0;
  for(int i=0;i<E;i++){
    edge e = es[i];
    if(!same(e.to,e.from)){
      unite(e.to,e.from);
      res += e.cost;
    }
  }
  return res;
}


long long int MOD = 1000000007;
long long int ruiseki[200001];
int ncrset(){
  ruiseki[0] = 1;
  for(int i=1;i<200001;i++){
    ruiseki[i] = (ruiseki[i-1] * i) % MOD;
  }
}

long long int powld(long long int x,long long int n){
  long long int ans = 1;
  while(n > 0){
    if((n&1) == 1){
      ans = (ans*x)  % MOD;
    }
    x = (x*x) % MOD;
    n >>= 1;
  }
  return ans % MOD;
}

int ncrgyaku(int n,int r){
  long long int gyakuk,gyakur;
  long long int res = 1,x,y,z;
  y = powld(ruiseki[r],MOD-2);
  z = powld(ruiseki[n-r],MOD-2);
  return (((ruiseki[n]*y) % MOD)*z) % MOD;

}
int dp[1000][1000][2];
bool solve(int one,int two,int turn){
  if(dp[one][two][turn] != -1)
    return dp[one][two][turn];
 
  if(one == 0 && two == 0)
    return 1-turn;
  if(turn){
    if((one > 0) && (two > 0))
      return dp[one][two][turn] = solve(one-1,two,1-turn) || solve(one+1,two-1,1-turn) || solve(one,two-1,1-turn);
    else if((one == 0) && (two > 0)){
      return dp[one][two][turn] = solve(one+1,two-1,1-turn) || solve(one,two-1,1-turn);
    }else{
      return dp[one][two][turn] = solve(one-1,two,1-turn);
    }
  }else{
    if(one > 0 && two > 0)
      return dp[one][two][turn] = solve(one-1,two,1-turn) && solve(one+1,two-1,1-turn) && solve(one,two-1,1-turn);
    else if(one == 0 && two > 0){
      return dp[one][two][turn] = solve(one+1,two-1,1-turn) && solve(one,two-1,1-turn);
    }else{
      return dp[one][two][turn] = solve(one-1,two,1-turn);
    }
  }

}

int main()
{
  REP(i,1000)REP(j,1000)REP(k,2)dp[i][j][k] = -1;
  int N,M[101],one=0,two=0;
  cin >> N;
  REP(i,N)cin >> M[i];
  for(int i=0;i<N;i++){
    vector<int> v(0);
    for(int k=2;M[i]!=1;k++){
      while(M[i] % k==0){
        v.push_back(k);
        M[i] /= k;
      }
    }
    map<int,int> mp;
    for(int j=0;j<v.size();j++)
      mp[v[j]]++;
   
    if(v.size() > 0)
      v.erase((unique(v.begin(),v.end())),v.end());
    REP(i,v.size()){
      two += mp[v[i]]/2;
      one += mp[v[i]]%2;
    }
  }
 
  cout << (solve(one,two,1) ? "Alice": "Bob") << endl;
  return 0;
}

int par[MAX_N];
int ranks[MAX_N];

//n要素で初期化
void init(int n){
  REP(i,n){
    par[i] = i;
    ranks[i] = 0;
  }

}

//木の根を求める
int find(int x){
  if(par[x] == x){
    return x;
  }else{
    return par[x] = find(par[x]);
  }
}

void unite(int x,int y){
  x = find(x);
  y = find(y);
  if(x == y) return ;
  if(ranks[x] < ranks[y]){
    par[x] = y;
  }else{
    par[y] = x;
    if(ranks[x] == ranks[y]) ranks[x]++;
  }
}

bool same(int x, int y){
  return find(x) == find(y);
}