PROGRAMMING:[cycle] [-- no digit a --]

Now enter an integer. Please find out which digit is missing in each digit of the integer and output the missing digit. See the example for details.
###Input format:
Enter an integer, and the data must be in the range of int
###Output format:
According to the order of 0 ~ 9, for each bit of the input number split, which digit is missing, you need to output this digit, and output carriage return line feed.
###Input sample 1:
Here is a set of inputs. For example:
```in
one million two hundred and thirty-four thousand five hundred and sixty-seven
```
###Output sample 1:
The corresponding output is given here, because after the bit decomposition of 1234567, there is no 0, no 8, no 9
```out
0
eight
nine
```
###Input sample 2:
Here is a set of inputs. For example:
```in
nine hundred and seventy-five million four hundred and seventy-eight thousand nine hundred and forty
```
###Output sample 2:
The corresponding output is given here, because after the bit decomposition of 975478940, there is no 1, no 2, no 3, no 6
```out
one
two
three
six
```







answer：If there is no answer, please comment