#include <bits/stdc++.h>
    using namespace std;
    #include <math.h>
    #include <iomanip>
    #include <cstdint>
    #include <string>
    #include <sstream>
    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; }
    #define rep(i,n) for (int i = 0; i < (n); ++i)
    typedef long long ll;
    typedef long double ld;
    typedef unsigned long long ull;
    using P=pair<ll,ll>;
    const ll INF=1001001001;
    const int mod=1e9+7;
    
    void solve(){
        string s;
        cin>>s;
        int n=s.size();
        reverse(s.begin(),s.end());
        vector<int>d(1000);
        int sz=0;
        rep(i,n){
            int k=s[i]-'A'+10;
            rep(j,4){d[sz++]=k%2;k/=2;}
        }
        while(sz%3){d[sz++]=0;}
        vector<int>cnt(8);
        for(int i=0;i<sz;i+=3){
            int k=d[i]+d[i+1]*2+d[i+2]*4;
            cnt[k]++;
        }

        int mx=*max_element(cnt.begin(),cnt.end());
        vector<int>ans;
        rep(i,8){
            if(mx==cnt[i]){
                ans.push_back(i);
            }
        }
        rep(i,ans.size()){
            if(i){cout<<" ";}
            cout<<ans[i];
        }
        cout<<endl;
    } 

    int main(){
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        
        solve();

        return 0;
    }