b-a>a为必胜态,所以问题就转化为看谁先达到这个状态
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
int a, b;
void solve() {
bool f = true;
while (true) {
if (a > b) swap(a, b);
if (b % a == 0) break;
if (b - a > a) break;
b -= a;
f = !f;
}
if (f) puts("Stan wins");
else puts("Ollie wins");
}
int main() {
while (~scanf("%d %d", &a, &b) && a+b) {
solve();
}
return 0;
}