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

#define ll long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define P pair<int, int>
#define LP pair<ll, ll>
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define all(s) s.begin(), s.end()
#define rall(s) s.rbegin(), s.rend()
template<class T>
void chmax(T& a, T b) { a = max(a, b); };
template<class T>
void chmin(T& a, T b) { a = min(a, b); };

int main() {
  string s16;
  cin >> s16;
  reverse(all(s16));
  string s2;
  for (int i = 0; i < s16.size(); i++) {
    auto f2 = [&](string s, int i) {
      if (s[i] == 'A') return "0101";
      else if (s[i] == 'B') return "1101";
      else if (s[i] == 'C') return "0011";
      else if (s[i] == 'D') return "1011";
      else if (s[i] == 'E') return "0111";
      else return "1111";
    };
    s2 += f2(s16, i);
  }
  int n2 = s16.size()*4;
  if (n2%3) {
    rep(i,3-n2%3) s2.pb('0');
  }
  reverse(all(s2));
  vector<int> cnt(8);

  for (int i = 0; i < s2.size(); i += 3) {

    auto f8 = [&](string s) {
      int res = 0;
      res += (s[0]-'0')*4;
      res += (s[1]-'0')*2;
      res += (s[2]-'0');
      return res;
    };

    int num8 = f8(s2.substr(i,3));
    cnt[num8]++;
  }
  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,ans.size()) {
    cout << ans[i];
    if (i < ans.size()-1) cout << " ";
  }
  cout << endl;


  return 0;
}