Problem: There is a puzzle to complete by combining 14 numbers from 1 to 9. Complete by adding another number to the given 13 numbers.

The conditions for completing the puzzle are

* You must have one combination of the same numbers.
* The remaining 12 numbers are 4 combinations of 3 numbers.
The combination of three numbers is either three of the same numbers or three consecutive numbers. However, sequences such as 9 1 2 are not considered consecutive numbers.
* The same number can be used up to 4 times.



Create a program that reads a string of 13 numbers and outputs all the numbers that can complete the puzzle in ascending order. If you cannot complete the puzzle by adding any number from 1 to 9, output 0.

For example, if the given string is 3456666777999

If there is a "2", 234 567 666 77 999
If there is a "3", then 33 456 666 777 999
If there is a "5", then 345 567 666 77 999
If there is an "8", then 345 666 678 77 999

And so on, the puzzle is complete when one of the numbers 2 3 5 8 is added. Note that "6" is fine, but it will be used for the 5th time, so it cannot be used in this example.



Input

The input consists of multiple datasets. For each dataset, 13 numbers are given on one line. The number of datasets does not exceed 50.

Output

For each dataset, the numbers that can complete the puzzle are output on one line in ascending order, separated by blanks.

Example

Input

3649596966777
6358665788577
9118992346175
9643871425498
7755542764533
1133557799246


Output

2 3 5 8
3 4
1 2 3 4 5 6 7 8 9
7 8 9
1 2 3 4 6 7 8
0

Solution (in CPP):

Solution:
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
bool serch(std::vector<int>&nums)
{
	const int length = nums.size();
	static int found_hand = 0;
	switch (found_hand)
	{
	case 0:
		int pair[2];
		for (int i = 0; i < length - 1; i++)
		{
			for (int j = i + 1; j < length; j++)
			{
				if (nums[i] == nums[j])
				{
					pair[0] = nums[i];
					pair[1] = nums[j];
					nums.erase(nums.begin() + j);
					nums.erase(nums.begin() + i);
					found_hand++;
					if (serch(nums))
					{
						return true;
					}
					else
					{
						nums.push_back(pair[0]);
						nums.push_back(pair[1]);
						std::sort(nums.begin(), nums.end());
						found_hand--;
					}
				}
			}
		}
		break;
	default:
		int trio[3];
		for (int i = 0; i < length - 2; i++)
		{
			for (int j = i + 1; j < length - 1; j++)
			{
				for (int k = j + 1; k < length; k++)
				{
					if (nums[i] == nums[j] && nums[j] == nums[k] || nums[j] == nums[i] + 1 && nums[k] == nums[j] + 1)
					{
						trio[0] = nums[i];
						trio[1] = nums[j];
						trio[2] = nums[k];
						nums.erase(nums.begin() + k);
						nums.erase(nums.begin() + j);
						nums.erase(nums.begin() + i);
						found_hand++;
						if (found_hand == 5 || serch(nums))
						{
							found_hand = 0;
							return true;
						}
						else
						{
							nums.push_back(trio[0]);
							nums.push_back(trio[1]);
							nums.push_back(trio[2]);
							std::sort(nums.begin(), nums.end());
							found_hand--;
						}
					}
				}
			}
		}
		break;
	}
	return false;
}
int main()
{
	for (std::string str; std::cin >> str;)
	{
		std::vector<int>ans;
		ans.reserve(9);
		std::vector<int>nums;
		nums.reserve(14);
		std::vector<int>appearance_count(9, 0);
		for (auto i : str)
		{
			const int foo = static_cast<int>(i - '0');
			nums.push_back(foo);
			appearance_count[foo]++;
		}
		for (int i = 1; i <= 9; i++)
		{
			if (appearance_count[i] == 4)
			{
				continue;
			}
			auto nums_copy = nums;
			nums_copy.push_back(i);
			std::sort(nums_copy.begin(), nums_copy.end());
			if (serch(nums_copy))
			{
				ans.push_back(i);
			}
		}
		if (ans.size() == 0)
		{
			std::cout << '0';
		}
		else
		{
			for (int i = 0; i < ans.size(); i++)
			{
				if (i != 0)
				{
					std::cout << ' ';
				}
				std::cout << ans[i];
			}
		}
		std::cout << std::endl;
	}
	return 0;
}