Armstrong Number

Time Limit: 1 sec

 

The Problem

An Armstrong Number is an n-digit number which is equal to the n^th power sum of its individual digits. 

 

Example:

371 is a three digit number.

= 3³ + 7³ + 1³

= 27 + 343 + 1

= 371

So, 371 is an Armstrong Number.

 

The Input

The Input file contains several lines. Each line contains an integer number N. N is a three digit number. Input is terminated by EOF

 

The Output

For each line of input print “N is an Armstrong Number” if N is an Armstrong Number otherwise print “N is not an Armstrong Number” in a separate line.

 

Sample Input

371

100

 

Sample Output

371 is an Armstrong Number

100 is not an Armstrong Number

 

 

 

 

Problem Setter: Samia Safa Ahmed