import java.util.Scanner;
import java.util.TreeSet;

public class Main {
	public static void main(String[] args) throws Exception {
		Scanner sc = new Scanner(System.in);
		String s = sc.next();
		sc.close();

		int[] cnt = new int[9];
		for (int i = 0; i < s.length(); i++) {
			cnt[s.charAt(i) - '1']++;
		}

		TreeSet<Integer> ans = new TreeSet<Integer>();

		// 七対子
		int one = 0;
		int two = 0;
		int idx = 0;
		for (int i = 0; i < cnt.length; i++) {
			if (cnt[i] == 1) {
				one++;
				idx = i;
			} else if (cnt[i] == 2) {
				two++;
			}
		}
		if (one == 1 && two == 6) {
			ans.add(idx);
		}

		int[] work = new int[9];

		for (int i = 0; i < 9; i++) {
			// 単騎
			System.arraycopy(cnt, 0, work, 0, cnt.length);
			if (work[i] > 0) {
				work[i]--;
				if (threes(work) && cnt[i] < 4) {
					ans.add(i);
				}
			}

			// シャンポン
			System.arraycopy(cnt, 0, work, 0, cnt.length);
			if (work[i] > 1) {
				for (int j = i + 1; j < 9; j++) {
					System.arraycopy(cnt, 0, work, 0, cnt.length);
					if (work[j] > 1) {
						work[i] -= 2;
						work[j] -= 2;
						if (threes(work)) {
							if (cnt[i] < 4) ans.add(i);
							if (cnt[j] < 4) ans.add(j);
						}
					}
				}
			}

			// カンチャン
			System.arraycopy(cnt, 0, work, 0, cnt.length);
			if (i < 7 && work[i] > 0 && work[i + 2] > 0) {
				for (int j = 0; j < 9; j++) {
					System.arraycopy(cnt, 0, work, 0, cnt.length);
					work[i]--;
					work[i + 2]--;
					if (work[j] > 1) {
						work[j] -= 2;
						if (threes(work) && cnt[i + 1] < 4) {
							ans.add(i + 1);
						}
					}
				}
			}

			// 両面、ペンチャン
			System.arraycopy(cnt, 0, work, 0, cnt.length);
			if (i < 8 && work[i] > 0 && work[i + 1] > 0) {
				for (int j = 0; j < 9; j++) {
					System.arraycopy(cnt, 0, work, 0, cnt.length);
					work[i]--;
					work[i + 1]--;
					if (work[j] > 1) {
						work[j] -= 2;
						if (threes(work)) {
							if (i > 0 && cnt[i - 1] < 4) ans.add(i - 1);
							if (i < 7 && cnt[i + 2] < 4) ans.add(i + 2);
						}
					}
				}
			}
		}

		for (int i : ans) {
			System.out.println(i + 1);
		}
	}

	static boolean threes(int[] work) {
		boolean flg = true;
		for (int i = 0; i < 9; i++) {
			if (work[i] >= 3) {
				work[i] -= 3;
			}
			while (work[i] > 0) {
				work[i]--;
				if (i < 8 && work[i + 1] > 0) {
					work[i + 1]--;
				} else {
					flg = false;
					break;
				}
				if (i < 7 && work[i + 2] > 0) {
					work[i + 2]--;
				} else {
					flg = false;
					break;
				}
			}
			if (!flg) {
				break;
			}
		}
		return flg;
	}
}