#K69397. Disarium Number Checker

    ID: 33077 Type: Default 1000ms 256MiB

Disarium Number Checker

Disarium Number Checker

Given a positive integer (n), determine whether it is a Disarium number. A number is called a Disarium number if the sum of its digits raised to the power of their respective positions equals the number itself. In other words, if (n) has digits (d_1, d_2, \ldots, d_k), then (n) is a Disarium number if [ d_1^1 + d_2^2 + \cdots + d_k^k = n ] Your task is to write a program which reads the number from standard input and prints "Disarium !!" if the condition holds or "Not!!" if it does not.

inputFormat

The input consists of a single positive integer (n) provided via standard input.

outputFormat

The program should output a single line: "Disarium !!" if (n) is a Disarium number, or "Not!!" otherwise.## sample

89
Disarium !!