Problem F
A Multiplication Game
Stan and Ollie play the game of multiplication by multiplying an integer $p$ by one of the numbers $2$ to $9$. Stan always starts with $p = 1$, does his multiplication, then Ollie multiplies the number, then Stan and so on. Before a game starts, they draw an integer $n$ and the winner is who first reaches $p \ge n$.
Input
Each line of input contains the integer $1 < n < 4\, 294\, 967\, 295$. There are at most $30$ lines of input.
Output
For each line of input output one line either
Stan wins.
or
Ollie wins.
assuming that both of them play perfectly.
Sample Input 1 | Sample Output 1 |
---|---|
162 17 34012226 |
Stan wins. Ollie wins. Stan wins. |