UVA 847 / GT

/***
 created: 2022-11-13-21.03.28
***/

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template<typename U> using ordered_set=tree<U, null_type,less<U>,rb_tree_tag,tree_order_statistics_node_update>;
#define ll long long
#define all(we) we.begin(),we.end()
#define test int tt; cin>>tt; for(int cs=1;cs<=tt;cs++)
#define nl '\n'

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);


    ll n,m,i,j,k,l;

    vector<ll>x;

    k=9;
    l=0;

    while(k<=4294967295)
    {
        x.push_back(k);
        if(l%2) k*=9;
        else k*=2;

        l++;
    }

    while(cin>>n && n)
    {
        for(i=0;i<x.size();i++)
        {
            if(x[i]>=n)
            {
                if(i%2==0) cout<<"Stan wins."<<nl;
                else cout<<"Ollie wins."<<nl;
                break;
            }
        }
    }

    return 0;
}