PROGRAMMING:Narcissistic number
####Title Description
```
An n-bit natural number P is said to be narcissistic if the sum of its digits to the nth power equals itself.
special:
When n = 1, all 1-digit numbers are narcissistic numbers (because all 1-digit numbers are equal to their power).
When n = 2, all 2-digit numbers are not narcissistic numbers (because all 2-digit numbers are not equal to the sum of squares of all the numbers).
When n = 3, there are four narcissistic numbers in the three digits: 153, 370, 371, 407. Because these four numbers are equal to the cube sum of its digits, they are also called "Narcissus numbers".
When n = 4, there are three narcissistic numbers among the four digits: 1634, 8208 and 9474. Because they are equal to the sum of their numbers to the fourth power, they are also called "four leaf rose numbers".
The narcissistic number when n = 5 is also called "Pentagram number", which has only three.
There is only one narcissistic number when n = 6.
The narcissistic number when n = 7 is called the number of Big Dipper, only 4.
The narcissistic number when n = 8 is called the eight immortals number, with only three.
The narcissistic number when n = 9 is called the double ninth number, and the number is confidential.
The narcissistic number when n = 10 is called perfect number, and the number is confidential.
Your task is: programming to determine whether a number is narcissistic or not.
```
####Input format
Several positive integers separated by spaces, the number of integers is not more than 10, and the maximum number of each integer is 9 digits.
####Output format
For each integer, if it is narcissistic, output yes, otherwise output no, and separate the two outputs with a space.
####Input sample
```in
5 55 153 1234 9474 54748 548834
```
####Output sample
```out
YES NO YES NO YES YES YES
```
####Input sample
```in
24678050 146511208 100
```
####Output sample
```out
YES YES NO
```
answer：If there is no answer, please comment
```
An n-bit natural number P is said to be narcissistic if the sum of its digits to the nth power equals itself.
special:
When n = 1, all 1-digit numbers are narcissistic numbers (because all 1-digit numbers are equal to their power).
When n = 2, all 2-digit numbers are not narcissistic numbers (because all 2-digit numbers are not equal to the sum of squares of all the numbers).
When n = 3, there are four narcissistic numbers in the three digits: 153, 370, 371, 407. Because these four numbers are equal to the cube sum of its digits, they are also called "Narcissus numbers".
When n = 4, there are three narcissistic numbers among the four digits: 1634, 8208 and 9474. Because they are equal to the sum of their numbers to the fourth power, they are also called "four leaf rose numbers".
The narcissistic number when n = 5 is also called "Pentagram number", which has only three.
There is only one narcissistic number when n = 6.
The narcissistic number when n = 7 is called the number of Big Dipper, only 4.
The narcissistic number when n = 8 is called the eight immortals number, with only three.
The narcissistic number when n = 9 is called the double ninth number, and the number is confidential.
The narcissistic number when n = 10 is called perfect number, and the number is confidential.
Your task is: programming to determine whether a number is narcissistic or not.
```
####Input format
Several positive integers separated by spaces, the number of integers is not more than 10, and the maximum number of each integer is 9 digits.
####Output format
For each integer, if it is narcissistic, output yes, otherwise output no, and separate the two outputs with a space.
####Input sample
```in
5 55 153 1234 9474 54748 548834
```
####Output sample
```out
YES NO YES NO YES YES YES
```
####Input sample
```in
24678050 146511208 100
```
####Output sample
```out
YES YES NO
```
answer：If there is no answer, please comment