#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
using P = pair<int,int>;
#define rep(i, n) for(int i = 0; i < n; i++)
#define all(x) (x).begin(),(x).end()

int main(){
    string s;
    cin >> s;
    vector<int> cnt(8,0);
    int n = s.size();
    reverse(all(s));
    int now = 0;
    rep(i,(n+2)/3){
        int p = 0;
        for(int j=0;now<n && j<3;j++){
            p += (10 + s[now++]-'A') * pow(16,j);
        }
        while(p){
            cnt[p%8]++;
            p /= 8;
        }
    }
    int x = *max_element(all(cnt));
    rep(i,8) if(cnt[i]==x) cout << i << " ";
    cout << endl;
    return 0;
}