#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

int as_int(char c){
    if('0' <= c && c <= '9') return c-'0';
    return 10+c-'A';
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    string s; cin >> s;
    if(s == "0"){
        cout << 0 << endl;
        return 0;
    }
    reverse(s.begin(), s.end());
    int n = s.size();
    vector<int> ans(2*n);
    for(int i = 0; i < n; i++){
        int k = as_int(s[i]);
        int r = i%3;
        for(int j = 0; j < r; j++) k *= 2;
        int j = i+i/3;
        ans[j] += k;
    }
    vector<int> cnt(8);
    for(int i = 0; i < 2*n; i++){
        if(ans[i] > 8){
            ans[i+1] += ans[i]/8;
            ans[i] %= 8;
        }
    }
    while(ans.back() == 0) ans.pop_back();
    for(int x: ans) cnt[x]++;
    int mx = *max_element(cnt.begin(), cnt.end());
    vector<int> u;
    for(int i = 0; i < 8; i++){
        if(cnt[i] == mx) u.push_back(i);
    }
    print_vector(u);
}