PROGRAMMING:Java narcissus number
Narcissus number refers to an n-bit positive integer (7 ≥ n ≥ 3), the sum of the n-th power of the numbers in each bit of narcissus number is equal to itself. For example: 153 = 1 $$3 $+ 5 $$3 $+ 3 $$. Require the preparation of procedures to calculate the number of all n-bit Narcissus.
###Input format:
Enter a positive integer n (3 ≤ n ≤ 7).
###Output format:
Output all n-bit Narcissus numbers in ascending order, each number occupies one line.
###Input example:
Here is a set of inputs. For example:
```in
three
```
###Output example:
The corresponding output is given here. For 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:
Enter a positive integer n (3 ≤ n ≤ 7).
###Output format:
Output all n-bit Narcissus numbers in ascending order, each number occupies one line.
###Input example:
Here is a set of inputs. For example:
```in
three
```
###Output example:
The corresponding output is given here. For 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