#include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
#include <queue>
#include <map>
#include <cmath>
#include <iomanip>
#include <set>
#include <cstdio>

using namespace std;

int main() {
  string s;
  cin >> s;
  string t;
  for (int i = 0; i < s.size(); i++) {
    if (s[i] == 'A') t += "1010";
    if (s[i] == 'B') t += "1011";
    if (s[i] == 'C') t += "1100";
    if (s[i] == 'D') t += "1101";
    if (s[i] == 'E') t += "1110";
    if (s[i] == 'F') t += "1111";
  }
  if (t.size() % 3 == 1) t = "00" + t;
  else if (t.size() % 3 == 2) t = "0" + t;
  string ans;
  for (int i = 0; i < t.size(); i += 3) {
    string x = t.substr(i , 3);
    if (x == "000") {
      ans += '0';
    } else if (x == "001") {
      ans += '1';
    } else if (x == "010") {
      ans += '2';
    } else if (x == "011") {
      ans += '3';
    } else if (x == "100") {
      ans += '4';
    } else if (x == "101") {
      ans += '5';
    } else if (x == "110") {
      ans += '6';
    } else if (x == "111") {
      ans += '7';
    }
  }
  vector<int> cnt(8 , 0);
  for (int i = 0; i < ans.size(); i++) {
    cnt[ans[i] - '0']++;
  }
  vector<pair<int,int> > p(8);
  for (int i = 0; i < 8; i++) {
    p[i] = make_pair(cnt[i] , -i);
  }
  sort(p.begin() , p.end());
  reverse(p.begin() , p.end());
  for (int i = 0; i < 8; i++) {
    if (i == 0) {
      cout << -p[i].second;
    } else {
      if (p[i].first != p[i - 1].first) {
        cout << endl;
        break;
      } else {
        cout << -p[i].second;
      }
    }
    cout << " ";
  }
  return 0;
}