#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=1167167167167167167;
const int INF=2100000000;
const ll mod=1e9+7;
#define rep(i,a) for (ll i=0;i<a;i++)
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}



//  rainy ~ 雨に打たれて ~
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	string S;
	cin>>S;
	reverse(S.begin(),S.end());
	int n=S.size();
	vector<pair<int,int>> ans(9);
	rep(i,8) ans[i].second=(-i);
	for(int i=0;i<n;i+=3){
		int r=(i+2);
		chmin(r,n-1);
		int x=0;
		for(int j=r;j>=i;j--){
			x*=16;
			x+=(S[j]-'A')+10;
		}
		//cout<<x<<endl;
		while(x!=0) ans[x%8].first++,x/=8;
	}
	Sore(ans);
	int ind=0;
	while(true){
		cout<<ans[ind].second*-1;
		if(ans[ind].first==ans[ind+1].first){
			ind++;
			cout<<" ";
		}else{
			cout<<"\n";
			return 0;
		}
	}
}