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

const string msg[] = { "Bob", "Alice" };

map< int, int > dp;

int dfs( int n, const vector< int > choice ){
  if( n == 1 )
    return 0;
  if( dp.count( n ) )
    return dp[ n ];
  for( int i = 0; i < choice.size(); ++i ){
    if( n % choice[ i ] != 0 ) continue;
    for( int j = n; j % choice[ i ] == 0; j /= choice[ i ] ){
      if( not dfs( j / choice[ i ], choice ) )
        return dp[ n ] = 1;
    }
  }
  return dp[ n ] = 0;
}

signed main(){
  int N; cin >> N;
  vector< int > choice;
  int n = N;
  for( int i = 2; i * i <= N; ++i ) if( n % i == 0 ){
    int ng = 0;
    for( int j = 2; j * j <= i; ++j )
      ng |= i % j == 0;
    if( ng ) continue;
    choice.emplace_back( i );
    while( n % i == 0 )
      n /= i;
  }
  if( n > 1 )
    choice.emplace_back( n );
  cout << msg[ dfs( N, choice ) ] << endl;
  return 0;
}