PROGRAMMING:Searching for "powerful" numbers
The so-called "powerful" number means that the 5th power of each digit is equal to the number itself. Programming output all the length does not exceed n bits of positive integers in the "severe" number.
For example: 4151 = $$4 ^ 5 + 1 ^ 5 + 5 ^ 5 + 1 ^ 5$$
###Input format:
An integer n (1 < = n < = 6)
###Output format:
One number per line
###Input example:
```in
four
```
###Output example:
```out
one
four thousand one hundred and fifty
four thousand one hundred and fifty-one
```
answer：If there is no answer, please comment
For example: 4151 = $$4 ^ 5 + 1 ^ 5 + 5 ^ 5 + 1 ^ 5$$
###Input format:
An integer n (1 < = n < = 6)
###Output format:
One number per line
###Input example:
```in
four
```
###Output example:
```out
one
four thousand one hundred and fifty
four thousand one hundred and fifty-one
```
answer：If there is no answer, please comment