//No.1729 ~サンプルはちゃんと見て!~ 16進数と8進数(1) #pragma GCC optimize("O3") #pragma GCC target("avx") #include #define rep(i ,n) for(int i=0;i<(int)(n);++i) #define repr(i ,n) for(int i=n;i>(int)(n);--i) #define rep1(i ,n) for(int i=1;i<=(int)(n);++i) #define ALL(a) a.begin(), a.end() #define RSORT(a) sort(ALL(a),greater<>()) #define SORT(a) sort(ALL(a)) #define bit_check(bit, i) ((bit>>(i)) & 1) #define PRINT(x) cout << (x) << endl; #define ENDL cout << endl; using namespace std; typedef long long int i64; typedef unsigned long long u64; template using V = vector; using VI = V; const int INF = 2e9; const i64 MOD = 1e9 + 7; template inline bool chmin(T& a, T b){if(a>b){a=b; return true;} return false;} template inline bool chmax(T& a, T b){if(a= 0 ; --i , ++j){ ret += ( n[i]-55 ) * (u64)pow( 16 , j); } return ret; } string toOct( u64 dec){ VI tmp; while( dec ){ tmp.push_back( dec % 8); dec /= 8; } reverse(ALL(tmp)); string ret = ""; rep( i , tmp.size()){ ret += to_string(tmp[i]); } return ret; } signed main(){ string n; cin >> n; u64 nd = toDec( n ); string nh = toOct( nd); VI cnt(8); for( int i = 0 ; i < nh.length() ; ++i){ rep ( j , 8){ if( nh[i] == j + '0') { ++cnt[j]; break; } } } int mx = -1; VI ans; for( int i = 0 ; i < 8 ; ++i){ mx = max( mx , cnt[i]); } for( int i = 0 ; i < 8 ; ++i){ if( cnt[i] == mx){ cout << i << " "; } } cout << endl; }