#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <stack>
#include <queue>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#include <fstream>
#include <chrono>
#include <random>
#include <bitset>
//#include <atcoder/all>
#include <sstream>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) ((int)(x).size())
#define pb push_back
using ll = long long;
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}

int main(){
  string S; cin >> S;
  vector<int> cnt(8,0);
  string T="";
  rep(i,sz(S)){
    int a = (S[i]-'A')+10;
    rep(j,4) T+=(char)('0'+((a>>j)&1));
  }
  while(sz(T)%3)T+='0';
  rep(i,sz(T)/3){
    string t = T.substr(i*3,3);
    int n=0;
    rep(j,3){
      if(t[j]=='1') n+=(1<<j);
    }
    cnt[n]++;
  }
  int mx = 0;
  rep(i,8) chmax(mx,cnt[i]);
  vector<int> ans;
  rep(i,8){
    if(cnt[i]==mx) ans.pb(i);
  }
  rep(i,sz(ans)){
    if(i) cout << ' ';
    cout << ans[i];
  }
  cout << endl;
  return 0;
}