#pragma GCC optimize("Ofast")
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <cstdio>
#include <ctime>
#include <assert.h>
#include <chrono>
#include <random>
#include <numeric>
#include <set>
#include <deque>
#include <stack>
#include <sstream>
#include <utility>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <tuple>
#include <array>
#include <bitset>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
    return (ull)rng() % B;
}
inline double time() {
    return static_cast<double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    vector<pair<int,int>> v(8);
    for(int i=0;i<8;i++){
        v[i].second = -i-1;
    }
    string s; cin >> s;
    string ss = "";
    for(char c:s){
        if(c == 'A')ss += "1010";
        else if(c == 'B')ss += "1011";
        else if(c == 'C')ss += "1100";
        else if(c == 'D')ss += "1101";
        else if(c == 'E')ss += "1110";
        else ss += "1111";
    }
    while(ss.size()){
        int r = 0;
        for(int i=0;i<3 and ss.size();i++){
            if(ss.back() == '1') r += (1<<i);
            ss.pop_back();
        }
        v[r-1].first++;
    }
    sort(v.rbegin(), v.rend());
    for(int i=0;i<v.size();i++){
        if(v[i].first == v[0].first){
            cout << -v[i].second << " ";
        }
    }
    cout << endl;
}