PROGRAMMING:Conjecture of parity normalization
Program input a positive integer (greater than 1), verify the parity normalization conjecture, output each number of its operation process.
[popular science] parity normalization conjecture, also known as 3N + 1 conjecture, hail conjecture, Jiaogu conjecture, etc. Its content is "for any positive integer, if it is odd, multiply it by 3 and then add 1, if it is even, divide it by 2, and then loop in this way, you can finally get 1".
For example, integer 7, its transformation process is: 22, 11, 34, 17, 52, 26, 13, 40, 20, 10, 5, 16, 8, 4, 2, 1.
###Input example:
```in
seven
```
###Output example:
```out
22 11 34 17 52 26 13 40 20 10 5 16 8 4 2 1
```
###Input example:
```in
twenty-three
```
###Output example:
```out
70 35 106 53 160 80 40 20 10 5 16 8 4 2 1
```
answer：If there is no answer, please comment
[popular science] parity normalization conjecture, also known as 3N + 1 conjecture, hail conjecture, Jiaogu conjecture, etc. Its content is "for any positive integer, if it is odd, multiply it by 3 and then add 1, if it is even, divide it by 2, and then loop in this way, you can finally get 1".
For example, integer 7, its transformation process is: 22, 11, 34, 17, 52, 26, 13, 40, 20, 10, 5, 16, 8, 4, 2, 1.
###Input example:
```in
seven
```
###Output example:
```out
22 11 34 17 52 26 13 40 20 10 5 16 8 4 2 1
```
###Input example:
```in
twenty-three
```
###Output example:
```out
70 35 106 53 160 80 40 20 10 5 16 8 4 2 1
```
answer：If there is no answer, please comment