#!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def IR(n):
    return [I() for _ in range(n)]
def LIR(n):
    return [LI() for _ in range(n)]

sys.setrecursionlimit(1000000)
mod = 1000000007

def main():
    def f(n):
        g = 0
        i = 2
        while i*i <= n:
            s = 0
            while n%i == 0:
                n //= i
                s += 1
            g ^= s
            i += 1
        if n > 1:
            g ^= 1

        return g == 0

    n = I()
    print(["Alice", "Bob"][f(n)])
    return


if __name__ == "__main__":
    main()