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

using namespace std;
using ll = long long;

string f(char c){
    int N;
    string S = "";
    if ('0' <= c && c <= '9') N = c-'0';
    else N = c-'A'+10;
    for (int i=3; i>=0; i--){
        if (N & 1<<i) S += '1';
        else S += '0';
    }
    return S;
}

int main(){

    int N, mx=0;
    string S, T="";
    cin >> S;
    for (auto c : S) T += f(c);
    T = string((3 - (T.size() % 3)) % 3, '0') + T;

    map<string, int> mp;
    for (int i=0; i<T.size()/3; i++) mp[T.substr(i*3, 3)]++;
    for (auto [x, y] : mp) mx = max(mx, y);
    for (auto [x, y] : mp){
        if (y == mx){
            int ans=0;
            for (int i=0; i<3; i++){
                if (x[i] == '1') ans += 1<<(2-i);
            }
            cout << ans << " ";
        }
    }
    cout << endl;

    return 0;
}