#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef vector< int > vi;
typedef vector< vi > vvi;
typedef vector< ll > vl;
typedef vector< vl > vvl;
typedef pair< int, int > pii;
typedef vector< pii > vp;
typedef vector< double > vd;
typedef vector< vd > vvd;
typedef vector< string > vs;

template< class T1, class T2 >
int upmin( T1 &x, T2 v ){
  if( x > v ){
    x = v;
    return 1;
  }
  return 0;
}

template< class T1, class T2 >
int upmax( T1 &x, T2 v ){
  if( x < v ){
    x = v;
    return 1;
  }
  return 0;
}

const int INF = 0x3f3f3f3f;

int N;
vi M;

void init(){
  cin >> N;
  M = vi( N );
  for( int i = 0; i < N; ++i )
    cin >> M[ i ];
}

int np[ 10000 + 1 ];
vi pf[ 10000 + 1 ];
int mex[ 10000 + 1 ];

void preprocess(){
  for( int i = 2; i < 10000; ++i )
    if( not np[ i ] ){
      pf[ i ].emplace_back( i );
      for( int j = i + i; j <= 10000; j += i )
        np[ j ] = 1,
        pf[ j ].emplace_back( i );
    }
  for( int i = 2; i <= 10000; ++i ){
    set< int > ch_mex;
    for( int j = 0; j < pf[ i ].size(); ++j ){
      ch_mex.emplace( mex[ i / pf[ i ][ j ] ] );
      if( i / pf[ i ][ j ] % pf[ i ][ j ] == 0 )
        ch_mex.emplace( mex[ i / pf[ i ][ j ] / pf[ i ][ j ] ] );
    }
    for( int j = 0; ; ++j )
      if( not ch_mex.count( j ) ){
        mex[ i ] = j;
        break;
      }
  }
}

void solve(){
  int sg = 0;
  for( int i = 0; i < N; ++i )
    sg ^= mex[ M[ i ] ];
  const string player[] = { "Alice", "Bob" };
  cout << player[ sg == 0 ] << endl;
}

signed main(){
  ios::sync_with_stdio( 0 );
  init();
  preprocess();
  solve();
  return 0;
}