#include #include #include using namespace std; #define length(array) (sizeof(array) / sizeof(array[0])) int priming(int N, int primes[], int times[]) { int ps[N / 2 + 1]; ps[0] = 2; int index = 1; bool flag = false; for (int i = 3; i < N + 1; i += 2) { for (int j = 0; j < index; j++) { if (i % ps[j] == 0) { flag = true; break; } } if (flag) { flag = false; continue; } ps[index] = i; index++; } int index2 = 0; for (int i = 0; i < index; i++) { if (N % ps[i] == 0) { int shou = N; primes[index2] = ps[i]; times[index2] = 0; for (;shou % ps[i] == 0;) { times[index2]++; shou /= ps[i]; } index2++; } } return index2; } void printints(int list[], int l) { cout << "["; for (int i = 0; i < l; i++) { cout << list[i] << ", "; } cout << "]" << endl; } void copy(int moto[], int saki[], int l) { for (int i = 0; i < l; i++) { saki[i] = moto[i]; } } int judge(int times[], int l, int depth) { if (depth < 0) {return 100;} int sum = 0; for (int i = 0; i < l; i++) { sum += times[i]; } if (sum == 0) {return -1;} int saizen = -1; for (int i = 0; i < l; i++) { int next[l]; copy(times, next, l); for (int j = 0; j < times[i]; j++) { next[i] = j; saizen = max(saizen, -judge(next, l, depth + 1)); } } //cout << "winner: " << saizen << " at "; //printints(times, l); return saizen; } int main(void) { int N; cin >> N; int primes[int(sqrt(N))]; int times[int(sqrt(N))]; int l = priming(N, primes, times); /*printints(primes, l); printints(times, l);*/ //cout << judge(times, l, 0) << endl; int result = judge(times, l, 0); if (result == 1) { cout << "Alice" << endl; } else { cout << "Bob" << endl; } return 0; }