#![allow(unused)]

use kyoproio::*;
use std::{
    collections::*,
    io::{self, prelude::*},
    iter,
    mem::{replace, swap},
};

fn main() -> io::Result<()> {
    std::thread::Builder::new()
        .stack_size(10 * 1024 * 1024)
        .spawn(solve)?
        .join()
        .unwrap();
    Ok(())
}

fn solve() {
    let stdin = io::stdin();
    let mut kin = KInput::new(stdin.lock());
    let stdout = io::stdout();
    let mut out = io::BufWriter::new(stdout.lock());
    macro_rules! output {
        ($($args:expr),+) => { write!(&mut out, $($args),+) };
    }
    macro_rules! outputln {
        ($($args:expr),+) => { output!($($args),+); outputln!(); };
        () => { output!("\n"); if cfg!(debug_assertions) { out.flush(); } }
    }

    let s = kin.bytes().to_owned();
    let mut ans = Vec::new();
    for draw in (b'1'..=b'9').filter(|draw| s.iter().filter(|b| *b == draw).count() <= 3) {
        let mut t = s.clone();
        t.push(draw);
        if f(&t) || g(&t) {
            ans.push(draw);
        }
    }
    for x in ans {
        outputln!("{}", x as char);
    }
}

fn f(a: &[u8]) -> bool {
    // eprintln!("{}", String::from_utf8_lossy(&a));
    if a.len() == 2 {
        a[0] == a[1]
    } else {
        for x in b'1'..=b'9' {
            if a.iter().filter(|&&b| b == x).count() >= 3 {
                let mut ca = a.to_owned();
                let mut cnt = 0;
                ca.retain(|&b| if b == x && cnt < 3 {
                    cnt += 1;
                    false
                } else {
                    true
                });
                assert_eq!(ca.len(), a.len() - 3);
                if f(&ca) {
                    return true;
                }
            }
        }
        let mut cont = 0;
        for x in b'1'..=b'9' {
            cont |= (a.iter().find(|&&b| b == x).is_some() as i32) << (x - b'1') as i32;
        }
        for x in b'1'..=b'7' {
            let mut mask = 7 << (x - b'1') as i32;
            if cont & mask == mask {
                let mut ca = a.to_owned();
                ca.retain(|&b| if 1 << (b - b'1') as i32 & mask > 0 {
                    mask ^= 1 << (b - b'1') as i32;
                    false
                } else {
                    true
                });
                assert_eq!(ca.len(), a.len() - 3);
                if f(&ca) {
                    return true;
                }
            }
        }
        false
    }
}
fn g(a: &[u8]) -> bool {
    let mut a = a.to_owned();
    while !a.is_empty() {
        let len = a.len();
        for x in b'1'..=b'9' {
            if a.iter().filter(|&&b| b == x).count() == 2 {
                let mut cnt = 0;
                a.retain(|&b| if b == x && cnt < 2 {
                    cnt += 1;
                    false
                } else {
                    true
                });
            }
        }
        if len == a.len() {
            return false;
        }
    }
    true
}

// -----------------------------------------------------------------------------
pub mod kyoproio {
    #![warn(unused)]
    use std::io::prelude::*;
    pub trait Input: Sized {
        fn str(&mut self) -> &str;
        fn bytes(&mut self) -> &[u8] {
            self.str().as_ref()
        }
        fn input<T: InputParse>(&mut self) -> T {
            T::input(self).expect("input error")
        }
        fn iter<T: InputParse>(&mut self) -> Iter<T, Self> {
            Iter(self, std::marker::PhantomData)
        }
        fn seq<T: InputParse, B: std::iter::FromIterator<T>>(&mut self, n: usize) -> B {
            self.iter().take(n).collect()
        }
    }
    pub struct KInput<R> {
        src: R,
        buf: String,
        pos: usize,
    }
    impl<R: BufRead> KInput<R> {
        pub fn new(src: R) -> Self {
            Self {
                src,
                buf: String::with_capacity(1024),
                pos: 0,
            }
        }
    }
    impl<R: BufRead> Input for KInput<R> {
        fn str(&mut self) -> &str {
            loop {
                if self.pos >= self.buf.len() {
                    self.pos = 0;
                    self.buf.clear();
                    if self.src.read_line(&mut self.buf).expect("io error") == 0 {
                        return &self.buf;
                    }
                }
                let range = self.pos
                    ..self.buf[self.pos..]
                        .find(|c: char| c.is_ascii_whitespace())
                        .map(|i| i + self.pos)
                        .unwrap_or_else(|| self.buf.len());
                self.pos = range.end + 1;
                if range.end > range.start {
                    return &self.buf[range];
                }
            }
        }
    }
    pub struct Iter<'a, T, I>(&'a mut I, std::marker::PhantomData<*const T>);
    impl<'a, T: InputParse, I: Input> Iterator for Iter<'a, T, I> {
        type Item = T;
        fn next(&mut self) -> Option<Self::Item> {
            Some(self.0.input())
        }
    }
    pub trait InputParse: Sized {
        type Err: std::fmt::Debug;
        fn input<I: Input>(input: &mut I) -> Result<Self, Self::Err>;
    }
    macro_rules! from_str_impls {
        { $($T:ty)* } => {
            $(impl InputParse for $T {
                type Err = <$T as std::str::FromStr>::Err;
                fn input<I: Input>(input: &mut I) -> Result<Self, Self::Err> {
                    input.str().parse::<$T>()
                }
            })*
        };
    }
    from_str_impls! {
        String char bool f32 f64 isize i8 i16 i32 i64 i128 usize u8 u16 u32 u64 u128
    }
    macro_rules! tuple_impls {
        ($H:ident $($T:ident)*) => {
            impl<$H: InputParse, $($T: InputParse),*> InputParse for ($H, $($T),*) {
                type Err = ();
                fn input<I: Input>(input: &mut I) -> Result<Self, Self::Err> {
                    // ?
                    Ok(($H::input(input).unwrap(), $($T::input(input).unwrap()),*))
                }
            }
            tuple_impls!($($T)*);
        };
        () => {};
    }
    tuple_impls!(A B C D E F G);
}