Hide

# Problem I

Euclid's Game

25 7 11 7 4 7 4 3 1 3 1 0

and Stan wins.

## Input

The input consists of a number of lines. Each line contains two positive integers less than $2^{31}$ giving the starting two numbers of the game. Stan always starts. The last line of input contains two zeroes and should not be processed.

## Output

For each line of input, output one line saying either Stan wins or Ollie wins assuming that both of them play perfectly.

Sample Input 1 | Sample Output 1 |
---|---|

34 12 15 24 0 0 |
Stan wins Ollie wins |