#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<(n); ++i)
#define rep1(i,n) for(int i=1; i<=(n); ++i)
#define repi(i,a,b) for(int i=a; i<=(b); ++i)
#define rrep(i,n) for(int i=(n-1); i>=0; --i)
#define ALL(obj) (obj).begin(), (obj).end()
#define RALL(obj) (obj).rbegin(), (obj).rend()
#define pb push_back
#define mp make_pair
#define sz(v) (int)v.size()
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
using ll = long long;
using namespace std;
typedef pair<int,int> P;
struct aaa{aaa(){ cin.tie(0); ios::sync_with_stdio(0); cout<<fixed<<setprecision(20);};}aaaaaaa;
int MOD = 1e9 + 7;
int gcd(int a,int b){return b?gcd(b,a%b):a;}
int lcm(int a,int b){return (a*b)/gcd(a,b);}
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};

string S;
set<string> ps;

void pool(){
    vector<int> bo = {111,222,333,444,555,666,777,888,999,123,234,345,456,567,678,789};
    vector<int> at = {11,22,33,44,55,66,77,88,99};
    rep(i,sz(at)) rep(j,sz(bo)) rep(k,sz(bo)) rep(l,sz(bo)) rep(m,sz(bo)){
        string res = to_string(at[i])+to_string(bo[j])+to_string(bo[k])+to_string(bo[l])+to_string(bo[m]);
        bool flag = true;
        sort(ALL(res));
        repi(i,'1','9') if(count(ALL(res),i) > 4) flag = false;
        if(flag) ps.insert(res);
    }
    return;
}

bool judge(string s){
    sort(ALL(s));
    bool flag = false;
    map<char,int> hai;
    rep(i,sz(s)) hai[s[i]]++;

    //条件2
    int ct = 0;
    repi(i,'1','9') if(hai[i] == 2) ct++;
    if(ct == 7) flag = true;
    
    //条件1
    if(ps.find(s) != ps.end()) flag = true;
    
    return flag;
}

int main(){
    cin >> S;
    pool();
    
    repi(i,'1','9'){
        string T = S + (char)i;
        if(judge(T)) cout << (char)i << endl;
    }
}