Choco Moco

Aminul & Imran are good friends. Not only friends but also teammates. Their team NSU MeowMax qualified for the first Asia West Continent Championship 2019, India.

They often get together in a secret place called Mohuya & play different kinds of games. Their favorite game is Choco Moco.

They start this game with a bag of N delicious chocolates.

The game is played alternately. Aminul being the stubborn one, always starts the game by taking 1 chocolate from the bag & then Imran takes 2 chocolates from the bag if there are enough chocolates remaining in the bag. Then again, Aminul tries to take 3 chocolates from the bag & then Imran tries to take 4 chocolates & the game goes on.

The game ends when someone can’t take their desired number of chocolates & he loses the game.

Given the initial number of chocolates in the bag, can you find the winner?

Input

The first line consists of a single Integer T ( 1 ≤ T ≤1000 ) — the number of test cases.

For every test case you will be given an Integer N ( 0 ≤ N ≤ 2000000000 ), the initial number of chocolates in the bag.

Output

For every test case print “Aminul” If Aminul wins the game otherwise print “Imran” (without quotes).

Sample

Input	Output
5 1 5 8 10 1000000000	Aminul Imran Aminul Imran Imran

Explanation of Sample Case 3: Initially we have 8 chocoltates in the bag.
Aminul takes 1 chocolate. So, 7 chocolates remain in the bag. Then, Imran takes 2 chocolates. So, 5 chocolates remain. Aminul again takes 3 chocolates and now, 2 chocolates remain. Now, Imran has to take 4 chocolates but only 2 chocolates left, so he can't take his desired number of chocolates and loses the game.