#include <bits/stdc++.h>
#include <atcoder/modint>
using namespace std;
using namespace atcoder;
using mint = modint998244353;
//using mint = modint1000000007;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using tlll = tuple<ll, ll, ll>;
constexpr ll INF = 1LL << 60;
template<class T> bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;}
template<class T> bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return false;}
ll safemod(ll A, ll M) {return (A % M + M) % M;}
ll divfloor(ll A, ll B) {if (B < 0) {return divfloor(-A, -B);} return (A - safemod(A, B)) / B;}
ll divceil(ll A, ll B) {if (B < 0) {return divceil(-A, -B);} return divfloor(A + B - 1, B);}
#define FINALANS(A) do {cout << (A) << '\n'; exit(0);} while (false)

vector<ll> cnt(8, 0);
void f(char a, char b, char c, bool lzero)
{
  ll n = 256 * (a - 'A' + 10) + 16 * (b - 'A' + 10) + (c - 'A' + 10);
  //cerr << a << b << c << " " << lzero << " ";
  for (ll d = 0; d < 4; d++)
  {
    cnt.at(n % 8)++;
    //cerr << n % 8;
    n /= 8;
    if (!lzero && n == 0)
      break;
  }
  //cerr << endl;
}

int main()
{
  string S;
  cin >> S;
  ll N = S.size();

  for (ll i = N - 1; i >= 0; i -= 3)
  {
    char c = S.at(i);
    char b = (i - 1 >= 0 ? S.at(i - 1) : 'A' - 10);
    char a = (i - 2 >= 0 ? S.at(i - 2) : 'A' - 10);
    f(a, b, c, i - 3 >= 0);
  }

  ll Mx = *max_element(cnt.begin(), cnt.end());
  vector<ll> ans;
  for (ll i = 0; i < 8; i++)
  {
    if (cnt.at(i) == Mx)
      ans.push_back(i);
  }
  ll K = ans.size();
  for (ll i = 0; i < K; i++)
  {
    cerr << ans.at(i) << (i == K - 1 ? '\n' : ' ');
  }
}