Divisor Game Winner

You are given an integer k which represents the initial number in a game. Two players, Alice and Bob, take turns in the game with Alice making the first move. In each move, a player selects a proper divisor d of k (i.e., a divisor such that \(1 < d < k\) and \(k \mod d = 0\)) and the game continues with the new value of k equal to d. The game ends when Bob is unable to choose a proper divisor, and the winner is determined as follows:

• If k is a prime number at the start of the game, Bob cannot make a move, so Bob wins.
• If k is composite, then Alice has a winning strategy, and Alice wins.

Determine the winner of the game given the initial number k.

inputFormat

The input consists of a single integer k (\(2 \le k \le 10^7\)), which represents the initial number in the game.

outputFormat

Output a single line containing either "Alice" if Alice wins or "Bob" if Bob wins.

## sample

2

Bob

</p>