11:00 pm : HINT: For C++/C use unsinged long long int. 

Alice and Bob are having a war of XOR's, they each brought their own numbers X & Y, Alice starts first, they can attack each other's number with a XOR attack. That is, they can XOR each other's number with any number of the form 2^N. Whoever brings their opponent's number to strictly below Z first Wins. If they both play optimally who will win?

INPUT 
Three integers X, Y, Z. 

OUTPUT

Print "Alice"  if Alice wins "Bob" if Bob wins.

CONSTRAINTS

1<=Z<=X,Y<=2⁶⁴ -1