PROGRAMMING:Narcissistic number
Narcissus number refers to a positive integer with $$n $$bits ($$n / Ge 3 $). The sum of the $$n $$powers of the numbers in each bit of narcissus number is equal to itself. For example, $$153 = 1 ^ 3 + 5 ^ 3 + 3 ^ 3 $$. This problem requires the preparation of procedures to calculate the number of all $$n $$Narcissus.
###Input format:
Input gives a positive integer $$n $$($$3 / Le n / Le 7 $$) in one line.
###Output format:
Output all the $$n $$Narcissus numbers in increasing order, each number occupies one line.
###Input example:
```in
three
```
###Output example:
```out
one hundred and fifty-three
three hundred and seventy
three hundred and seventy-one
four hundred and seven
```
answer：If there is no answer, please comment
###Input format:
Input gives a positive integer $$n $$($$3 / Le n / Le 7 $$) in one line.
###Output format:
Output all the $$n $$Narcissus numbers in increasing order, each number occupies one line.
###Input example:
```in
three
```
###Output example:
```out
one hundred and fifty-three
three hundred and seventy
three hundred and seventy-one
four hundred and seven
```
answer：If there is no answer, please comment