PROGRAMMING:Output permutation
Please write the full permutation ($$n < 10 $) of the first $$n $$positive integers before the program output, and observe the running time of the program when the $$n $$increases gradually through 9 test cases (i.e. $$n $$from 1 to 9).
###Input format:
Enter to give a positive integer $$n $$($$< 10 $$).
###Output format:
Output the full permutation from 1 to $$n $. Each permutation occupies one line, and there is no space between the numbers. The output order of permutation is dictionary order, that is sequence $${a}_ 1, a_ 2, \cdots, a_ N} $$in sequence $${B_ 1, b_ 2, \cdots, b_ Before n} $, if there is $$k $$, make $$a_ 1=b_ 1, \cdots, a_ k=b_ K $$and $$a_{ k+1}###Input example:
```in
three
```
###Output example:
```out
one hundred and twenty-three
one hundred and thirty-two
two hundred and thirteen
two hundred and thirty-one
three hundred and twelve
three hundred and twenty-one
```
answer：If there is no answer, please comment
###Input format:
Enter to give a positive integer $$n $$($$< 10 $$).
###Output format:
Output the full permutation from 1 to $$n $. Each permutation occupies one line, and there is no space between the numbers. The output order of permutation is dictionary order, that is sequence $${a}_ 1, a_ 2, \cdots, a_ N} $$in sequence $${B_ 1, b_ 2, \cdots, b_ Before n} $, if there is $$k $$, make $$a_ 1=b_ 1, \cdots, a_ k=b_ K $$and $$a_{ k+1}
```in
three
```
###Output example:
```out
one hundred and twenty-three
one hundred and thirty-two
two hundred and thirteen
two hundred and thirty-one
three hundred and twelve
three hundred and twenty-one
```
answer：If there is no answer, please comment