#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int DY[]{1, 0, -1, 0}, DX[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1}, DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

string hex2oct(const string& s) {
  int dec = 0;
  for (char c : s) {
    dec = dec * 16 + (c - 'A') + 10;
  }
  string oct = "";
  for (; dec > 0; dec /= 8) {
    oct += '0' + (dec % 8);
  }
  reverse(ALL(oct));
  return oct;
}

int main() {
  constexpr int D = 10;
  string s; cin >> s;
  reverse(ALL(s));
  int digit[D]{};
  for (int i = 0; i < s.length(); i += 3) {
    string t = s.substr(i, min(int(s.length()) - i, 3));
    reverse(ALL(t));
    for (char c : hex2oct(t)) ++digit[c - '0'];
  }
  const int most = *max_element(digit, digit + D);
  vector<int> ans;
  REP(i, D) {
    if (digit[i] == most) ans.emplace_back(i);
  }
  const int n = ans.size();
  REP(i, n) cout << ans[i] << " \n"[i + 1 == n];
  return 0;
}