#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
//const bool debug = false;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	string s; cin >> s;
	stack<char>st;
	rep(i, s.size())st.push(s[i]);
	vector<int>count(8);
	while (st.size() >= 3) {
		int x = 0;
		rep(i, 3) {
			char c = st.top();
			st.pop();
			x *= 16;
			x += c - 'A' + 10;
		}
		rep(i, 4) {
			count[x % 8]++;
			x /= 8;
		}
	}
	{
		int x = 0;
		while (st.size()) {
			char c = st.top();
			st.pop();
			x *= 16;
			x += c - 'A' + 10;
		}
		stack<int>q;
		while (x) {
			q.push(x % 8);
			x /= 8;
		}
		while ((!q.empty()) && 0 == q.top()) q.pop();
		while (q.size()) {
			count[q.top()]++;
			q.pop();
		}
	}
	//rep(i, 8)cout << count[i] << endl;
	int mx = -1;
	rep(i, 8)chmax(mx, count[i]);
	vector<int>ans;
	rep(i, 8)if (mx == count[i])ans.push_back(i);
	rep(i, ans.size()) {
		if (0 != i)cout << " ";
		cout << ans[i];
	}
	cout << endl;
	return 0;
}