#include <bits/stdc++.h>
using namespace std;

const int MOD = (1e9+7);
void printmat(const vector<vector<int>>& mat) {
    for (auto row : mat) {
        for (auto elem : row)
            cout << elem << " ";
        cout << endl;
    }
}
void printv(const vector<int>& v) {
    for (auto elem : v)
        cout << elem << " ";
    cout << endl;
}
void printvs(const vector<set<int>>& vs) {
    for (auto row : vs) {
        for (auto elem : row)
            cout << elem << ", ";
        cout << endl;
    }
}
void printht(const unordered_map<int, int>& ht) {
    for (auto elem : ht)
        cout << elem.first << " : " << elem.second << endl;
}
void printmp(const map<int, int>& ht) {
    for (auto elem : ht)
        cout << elem.first << " : " << elem.second << endl;
}
void printst(const set<int>& st) {
    for (auto elem : st)
        cout << elem << " ";
    cout << endl;
}

map<long long, long long> primeFactors(long long n) {
    map<long long, long long> ans;
    while (n % 2 == 0) {
        ans[2]++;
        n = n/2;
    }
    for (long long i = 3; i*i <= (n); i = i + 2) {
        while (n % i == 0) {
            ans[i]++;
            n = n/i;
        }
    }
    if (n > 2)
        ans[n]++;
    return ans;
}

int find_f(const vector<int>& uf, int i) {
    while (uf[i]!=i)
        i = uf[i];
    return i;
}
bool union_f(vector<int>& uf, vector<int>& sz, int a, int b) {
    a = find_f(uf, a);
    b = find_f(uf, b);
    //cout << "a, b = " << a << ", " << b << endl;
    if (a==b) return false;
    if (sz[a] < sz[b]) {
        //cout << "sz[a], sz[b] = " << sz[a] << ", " << sz[b] << endl;
        //cout << "a, b = " << a << ", " << b << endl;
        swap(a,b);
        //cout << "a, b = " << a << ", " << b << endl;
    }
    sz[a] += sz[b];
    uf[b] = a;
    return true;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);    
    int T=1, caseIdx=0;
    //cin >> T;  
    while (T--) {
        //caseIdx++;
        string s;
        cin >> s;
        int count = 0;
        stack<char> st;
        for (char c : s) {
            switch (c) {
                case '0': st.push('0');st.push('0');st.push('0');st.push('0');break;
                case '1': st.push('1');st.push('0');st.push('0');st.push('0');break;
                case '2': st.push('0');st.push('1');st.push('0');st.push('0');break;
                case '3': st.push('1');st.push('1');st.push('0');st.push('0');break; 
                case '4': st.push('0');st.push('0');st.push('1');st.push('0');break;
                case '5': st.push('1');st.push('0');st.push('1');st.push('0');break;
                case '6': st.push('0');st.push('1');st.push('1');st.push('0');break;
                case '7': st.push('1');st.push('1');st.push('1');st.push('0');break;  
                case '8': st.push('0');st.push('0');st.push('0');st.push('1');break;
                case '9': st.push('1');st.push('0');st.push('0');st.push('1');break;
                case 'A': st.push('0');st.push('1');st.push('0');st.push('1');break;
                case 'B': st.push('1');st.push('1');st.push('0');st.push('1');break; 
                case 'C': st.push('0');st.push('0');st.push('1');st.push('1');break;
                case 'D': st.push('1');st.push('0');st.push('1');st.push('1');break;
                case 'E': st.push('0');st.push('1');st.push('1');st.push('1');break;
                case 'F': st.push('1');st.push('1');st.push('1');st.push('1');break;
            }
            count += 4;
        }
        while (count%3!=0) {
            st.push('0');
            count++;
        }
        vector<int> tally(8);
        while (!st.empty()) {
            int val = 4*(st.top()-'0');
            st.pop();
            val += 2*(st.top()-'0');
            st.pop();
            val += (st.top()-'0');
            st.pop();
            tally[val]++;
        }
        int max_count = *max_element(tally.begin(), tally.end());
        for (int i=0; i<8; i++) {
            if (tally[i]==max_count)
                cout << i << " ";
        }
        cout << endl;
        
        //cout << "Case #" << caseIdx << ": " << s << endl;
    }
}