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

kasha01 | 8 |

pimcub2011 | 8 |

Chris Hawkes | 5 |

slim1972 | 4 |

saxenautkarsh | 4 |

N NAGA SAI KRISHNA | 757 |

whomi | 628 |

Anshu Ahirwar | 598 |

gau7av | 501 |

gameghost07 | 488 |

akhayrutdinov | 3456 |

sanjay05 | 3327 |

Jasleen Kaur 2 | 2012 |

Michael Riegger | 1821 |

Quandray | 1817 |