问题描述 :
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 1 < n < 4294967295 and the winner is who first reaches p >= n.
输入:
Each line of input contains one integer number n.
输出:
For each line of input output one line either
Stan wins.
or
Ollie wins.
assuming that both of them play perfectly.
样例输入:
162
17
34012226
样例输出:
Stan wins.
Ollie wins.
Stan wins.
http://www.cnblogs.com/jiangjun/archive/2012/11/09/2762280.html