#include using namespace std; #define rep(i,n) for(int i = 0; i < (int)n; i++) #define FOR(n) for(int i = 0; i < (int)n; i++) #define repi(i,a,b) for(int i = (int)a; i < (int)b; i++) #define pb push_back #define m0(x) memset(x,0,sizeof(x)) #define fill(x,y) memset(x,y,sizeof(x)) #define bg begin() #define ed end() #define all(x) x.bg,x.ed #define vi vector #define vvi vector #define vll vector #define vvll vector #define vs vector #define vvs vector #define vc vector #define vvc vector #define pii pair #define pllll pair #define vpii vector> #define vpllll vector> #define vpis vector> #define vplls vector> #define vpsi vector> #define vpsll vector> #define int long long using ll = long long; using ld = long double; using ull = unsigned long long; const ll INF = 1e15; const ld pi = acos(-1); ll mod = 0; int dx[] = {-1, 0, 1, 0, -1, -1, 1, 1}; int dy[] = {0, -1, 0, 1, -1, 1, -1, 1}; void solve() { string n; cin >> n; map> mp; rep(i, 8) mp[char('0' + i)] = {0, i}; mp['8'] = {1, 0}; mp['9'] = {1, 1}; mp['A'] = {1, 2}; mp['B'] = {1, 3}; mp['C'] = {1, 4}; mp['D'] = {1, 5}; mp['E'] = {1, 6}; mp['F'] = {1, 7}; map cnt; for(char c : n) { pair p = mp[c]; cnt[p.first]++; cnt[p.second]++; } int mx = 0; vector ans; for(auto e : cnt) { if(mx < e.second) { mx = e.second; ans.clear(); ans.push_back(e.first); }else if(mx == e.second) { ans.push_back(e.first); } } for(auto e : ans) cout << e << " "; } //extended_gcdの理解 //leven shtein distance の理解 // //typical 90 - 81~ //edpc I~ // score 500 ABC_E green // score 400 ABC_D cyan signed main() { cin.tie(nullptr); ios::sync_with_stdio(false); solve(); return 0; }