Multiplication Game

Alice and Bob play a multiplication game. An integer $p$ starts at $1$, and beforehand a fixed integer $n$ with $1 < n < 4294967295$ is chosen.

On each turn, the player to move multiplies $p$ by one integer between $2$ and $9$ inclusive. Alice moves first, then Bob, and they keep alternating turns.

The player who first makes $p \ge n$ wins.

Assuming both players play optimally, write a program that determines the winner.

The input consists of several test cases. Each test case is a single line containing the integer $n$. Process every test case until the end of input.

For each test case, print Alice wins. if Alice wins, or Bob wins. if Bob wins, one per line.