// Standard I/O
#include <iostream>
#include <sstream>
#include <cstdio>
// Standard Library
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <cmath>
// Template Class
#include <complex>
#include <string>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
// Container Control
#include <algorithm>

using namespace std;

#define rep( i, n ) for( int i = 0; i < n; ++i )
#define irep( i, n ) for( int i = n-1; i >= 0; --i )
#define reep( i, s, n ) for ( int i = s; i < n; ++i )
#define ireep( i, n, s ) for ( int i = n-1; i >= s; --i )
#define foreach(itr, x) for( typeof(x.begin()) itr = x.begin(); itr != x.end(); ++itr)

#define mp( a, b ) make_pair( a, b )
#define pb( a ) push_back( a )
#define all( v ) v.begin(), v.end()
#define fs first
#define sc second
#define vc vector

// for visualizer.html
double SCALE = 1.0;
double OFFSET_X = 0.0;
double OFFSET_Y = 0.0;
#define LINE(x,y,a,b) cerr << "line(" << SCALE*(x) + OFFSET_X << ","	\
	<< SCALE*(y) + OFFSET_Y << ","										\
	<< SCALE*(a) + OFFSET_X << ","										\
	<< SCALE*(b) + OFFSET_Y << ")" << endl;
#define CIRCLE(x,y,r) cerr << "circle(" << SCALE*(x) + OFFSET_X << ","	\
	<< SCALE*(y) + OFFSET_Y << ","										\
	<< SCALE*(r) << ")" << endl;

typedef long long ll;
typedef complex<double> Point;

typedef pair<int, int> pii;
typedef pair<int, pii> ipii;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector< vector<int> > vii;
typedef vector< vector<double> > vdd;

typedef vector<int>::iterator vi_itr;

const int IINF = 1 << 28;
const double INF = 1e30;
const double EPS = 1e-10;
const double PI = acos(-1.0);

// Direction : L U R D
const int dx[] = { -1, 0, 1, 0};
const int dy[] = { 0, -1, 0, 1 };

bool isprime[10010];
set<int> prime;
int main()
{
	reep(i,2,10010) isprime[i] = true;
	reep(i,2,10010) if( isprime[i] ){
		prime.insert(i);
		for( int j = 2*i; j < 10010; j+=i ) isprime[j] = false;
	}

	ll N, M = 0;
	cin >> N;

	bool n_is_prime = true;
	for ( auto i : prime ){
		if( i >= N ){
			break;
		}

		if( N % i == 0 ){
			n_is_prime = false;
			break;
		}
	}
	
	if( n_is_prime ){
		cout << "Alice" << endl;
		return 0;
	}

	vi num;
	auto itr = prime.begin();
	while( itr != prime.end() && N != 1 ){
		int tmp = 0;
		while( N % *itr == 0 ){
			N /= *itr;
			++tmp;
		}
		// cout << *itr << "^" << tmp << " * ";
		++itr;
		if( tmp != 0 ) num.pb(tmp);
	}
	// cout << endl;
	
	int a = 0, b = 0, c = 0;
	rep(i, num.size()){
		if( num[i] > 1 ){
			++a;
			c += num[i]-2;
		}
		else ++b;
	}
	
	queue<tuple<int, int, int, int>> que;
	que.push( make_tuple(a,b,c,0) );
	while( !que.empty() ){
		int a, b, c, t;
		auto p = que.front(); que.pop();
		tie(a, b, c, t) = p;

		// cout << a << " " << b << " " << c << " " << t << endl;
		
		if( a == 0 && b == 0 ){
			cout << (t == 0 ? "Bob" : "Alice") << endl;
			break;
		}
		
		if( a%2 == 0 && b%2 == 0 ){
			if( c > 0 ) que.push( make_tuple(a, b, c-1, !t) );
			else{
				if( a > 0 ) que.push( make_tuple(a-1,b+1,c,!t) );
				else{
					cout << (t == 0 ? "Bob" : "Alice") << endl;
					break;
				}
			}
		}
		else if( a%2 == 0 && b%2 == 1 ){
			que.push( make_tuple(a, b-1, c, !t) );
		}
		else if( a%2 == 1 && b%2 == 0 ){
			que.push( make_tuple(a-1, b, c-1, !t) );
		}
		else if( a%2 == 1 && b%2 == 1 ){
			que.push( make_tuple(a-1, b+1, c-1, !t) );
		}
	}
}