#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using V = vector<ll>;
using VV = vector<V>;
using VVV = vector<VV>;
using VS = vector<string>;
using VB = vector<bool>;
using VVB = vector<VB>;
using P = pair<ll,ll>;
using VP = vector<P>;
using M = map<ll,ll>;
using Q = queue<ll>;
using PQ = priority_queue<ll>;
using PQG = priority_queue<ll,V,greater<ll>>;
using S = set<ll>;
const ll MOD = 1000000007;
const ll mod = 998244353;
const ll INF = 1LL << 60;
#define rep(i,n) for(ll i = 0; i < n; i++)
#define rep2(i,s,n) for(ll i = s; i < n; i++)
#define per(i,n) for(ll i = n; i >= 0; i--)
#define per2(i,s,n) for(ll i = n; i >= s; i--)
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#define ep emplace
#define epb emplace_back
#define lb lower_bound
#define ub upper_bound
template<class T>bool chmin(T&a, const T&b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool chmax(T&a, const T&b){if(a<b){a=b;return 1;}return 0;}
template<class T>void Vin(vector<T>&a){rep(i,(int)a.size())cin>>a[i];}
template<class T>void Vout(const vector<T>&a){rep(i,(int)a.size())cout<<a[i]<<endl;}
ll power(ll a,ll b,const ll&M){a%=M;ll res=1;while(b>0){if(b&1)res=res*a%M;a=a*a%M;b>>=1;}return res;}
const ll H[4] = {0,1,0,-1}, W[4] = {1,0,-1,0};

int main() {
    string n;
    cin >> n;
    ll ns = n.size();
    reverse(all(n));
    V ans(8);
    while(ns) {
        ll cnt = 0, cnt2 = 0;
        rep(i,3) {
            if(!ns) break;
            cnt += (n[i]-'A'+10)*pow(16,i);
            ns--;
        }
        rep(i,4) {
            ans[cnt%8]++;
            cnt /= 8;
            if(!cnt && !ns) break;
        }
        if(!ns) break;
        n = n.substr(3,ns);
    }
    ll ma = *max_element(all(ans));
    rep(i,8) if(ans[i] == ma) cout << i << " ";
}