Automorphic Number

Given a positive integer \( n \), determine whether it is an automorphic number. An automorphic number is one whose square ends with the same digits as the number itself; that is, \( n^2 \) ends in \( n \). For example, since \( 25^2 = 625 \) and 625 ends with 25, the number 25 is automorphic.

inputFormat

The input is a single positive integer \( n \) provided via standard input.

outputFormat

Output a string via standard output: output Automorphic !! if \( n \) is automorphic; otherwise output Not !!.

25

Automorphic !!