PROGRAMMING:Exhaustion problem - moving bricks
A construction site needs to move bricks. It is known that one man moves' 3 ', one woman moves' 2', and two children move '1'. If you want to use 'n' people to move 'n' bricks, how many ways are there?
###Input format:
Enter a positive integer 'n' on a line.
###Output format:
The output shows a scheme on each line, according to "` men = cnt"_ m, women = cnt_ w, child = cnt_ C '"format, output the number of men ` CNT_ M, the number of women_ W, the number of children_ c`。 Notice that there is a space on each side of the equal sign and a space after the comma.
If no qualified scheme is found, output "` none '"
###Input example:
```in
forty-five
```
###Output example:
```out
men = 0, women = 15, child = 30
men = 3, women = 10, child = 32
men = 6, women = 5, child = 34
men = 9, women = 0, child = 36
```
answer：If there is no answer, please comment
###Input format:
Enter a positive integer 'n' on a line.
###Output format:
The output shows a scheme on each line, according to "` men = cnt"_ m, women = cnt_ w, child = cnt_ C '"format, output the number of men ` CNT_ M, the number of women_ W, the number of children_ c`。 Notice that there is a space on each side of the equal sign and a space after the comma.
If no qualified scheme is found, output "` none '"
###Input example:
```in
forty-five
```
###Output example:
```out
men = 0, women = 15, child = 30
men = 3, women = 10, child = 32
men = 6, women = 5, child = 34
men = 9, women = 0, child = 36
```
answer：If there is no answer, please comment