PROGRAMMING:The pity of the chickens
One rooster was old and weak, and his physical strength was not as good as before. In order to maintain the success rate of breeding, the farmer bought a rooster and left it in the henhouse. As the saying goes, one mountain does not allow two tigers, but one nest does not allow two chickens. After the little Rooster went, it can be said that he did his best to attract the attention of all the hens. The old Rooster felt that his status was not guaranteed and was very worried. So he proposed to hold a race with the new Rooster: those who win will stay, and those who lose will leave automatically. The next morning, the two chickens came to the starting line. With the start of a hen's gun, the two chickens rushed out of the runway like an arrow from the string and ran desperately forward. At the beginning, the old rooster was still far ahead. Later, his physical strength was gradually exhausted, and he was caught up by the little rooster. Just when the little rooster was about to catch up with the old rooster, suddenly, a "pa" shot rang out, and the little Rooster fell into a pool of blood... The farmer held a gun in his hand and said angrily, "they sold me a gay chicken again!"
After reading the joke, Xiao Hong decides to study hard. Just after opening a magazine, someone is selling chickens in the magazine. Xiao Hong decides to buy n chickens to play with, but Xiao Hong only has n yuan, big cock only needs 5 yuan, big hen only needs 4 yuan, and three chickens only need 2 yuan. How can Xiao Hong buy chickens;
###Input format:
Enter a number n (1 < = n < = 2000)（ There are multiple sets of inputs)
###Output format:
Output to meet the requirements of rooster, hen, chicken number of all cases (according to the number of rooster from small to large order). If not, output "no!"
###Input example:
Here is a set of inputs. For example:
```in
one
ten
five hundred and sixty-eight
```
###Output example:
The corresponding output is given here. For example:
```out
No!
0 1 9
6 49 513
16 36 516
26 23 519
36 10 522
```
answer：If there is no answer, please comment
After reading the joke, Xiao Hong decides to study hard. Just after opening a magazine, someone is selling chickens in the magazine. Xiao Hong decides to buy n chickens to play with, but Xiao Hong only has n yuan, big cock only needs 5 yuan, big hen only needs 4 yuan, and three chickens only need 2 yuan. How can Xiao Hong buy chickens;
###Input format:
Enter a number n (1 < = n < = 2000)（ There are multiple sets of inputs)
###Output format:
Output to meet the requirements of rooster, hen, chicken number of all cases (according to the number of rooster from small to large order). If not, output "no!"
###Input example:
Here is a set of inputs. For example:
```in
one
ten
five hundred and sixty-eight
```
###Output example:
The corresponding output is given here. For example:
```out
No!
0 1 9
6 49 513
16 36 516
26 23 519
36 10 522
```
answer：If there is no answer, please comment