Write a program to check whether a given number is Automorphic number or not.

A number is called Automorphic number if and only if its square ends in the same digits as the number itself.

For example, 76^{2} = 57**76 **which ends with 76 therefore it is a automorphic number.

**Input:**

The first line of the input contains T denoting the total number of testcases. Each of the next T lines contains a positive integer N denoting the value of a number.

**Output:**

Output "Automorphic" if given number is Automorphic else "Not Automorphic" .

**Constraints:**

1<=T<=100

1<=N<=1000

**Example:**

Input:

2

1

16

Output:

Automorphic

Not Automorphic

#### **For More Examples Use Expected Output**