PROGRAMMING:369 dormitory
Dormitory 369 is a special one, because there are four people in other dormitories, while there are only three people in dormitory 369. Because of this reason, the three students in the dormitory have a very good relationship. However, graduation is just around the corner, and the three little friends will be separated soon. In order to meet one day in the future, the three little partners have an agreement. Suppose that in a certain year in the future, three numbers of 3, 6 and 9 will appear at the end of their age, then they will get together again.
Now the question is, suppose that the three young partners are x, y and Z this year, then how early can they get together?
###Input format:
The input data includes three integers x, y, Z, which represent the age of the three partners.
###Output format:
If the partners can meet as early as N years later (excluding the current year), please output this n; If this situation does not exist in 100 years, output: so sad!
###Input example:
```in
25 22 28
```
###Output example:
```out
one
```
answer：If there is no answer, please comment
Now the question is, suppose that the three young partners are x, y and Z this year, then how early can they get together?
###Input format:
The input data includes three integers x, y, Z, which represent the age of the three partners.
###Output format:
If the partners can meet as early as N years later (excluding the current year), please output this n; If this situation does not exist in 100 years, output: so sad!
###Input example:
```in
25 22 28
```
###Output example:
```out
one
```
answer：If there is no answer, please comment