B'Mojtaba and Arpa are playing a game. They have a list of n numbers in the game. In a player 's turn, he chooses a number pk (where p is a prime number and k is a positive integer) such that pk divides at least one number in the list. For each number in the list divisible by pk, call it x, the player will delete x and add to the list. The player who can not make a valid choice of p and k loses. Mojtaba starts the game and the players alternatively make moves. Determine which one of players will be the winner if both players play optimally. The first line contains a single integer n (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89100) -- the number of elements in the list. The second line contains n integers a1, xe2 x80 x89a2, xe2 x80 x89..., xe2 x80 x89an (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89ai xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89109) -- the elements of the list. If Mojtaba wins, print "Mojtaba", otherwise print "Arpa" (without quotes). You can print each letter in any case (upper or lower). In the first sample test, Mojtaba can 't move. In the second sample test, Mojtaba chooses p xe2 x80 x89= xe2 x80 x8917 and k xe2 x80 x89= xe2 x80 x891, then the list changes to [1, xe2 x80 x891, xe2 x80 x891, xe2 x80 x891]. In the third sample test, if Mojtaba chooses p xe2 x80 x89= xe2 x80 x8917 and k xe2 x80 x89= xe2 x80 x891, then Arpa chooses p xe2 x80 x89= xe2 x80 x8917 and k xe2 x80 x89= xe2 x80 x891 and wins, if Mojtaba chooses p xe2 x80 x89= xe2 x80 x8917 and k xe2 x80 x89= xe2 x80 x892, then Arpa chooses p xe2 x80 x89= xe2 x80 x8917 and k xe2 x80 x89= xe2 x80 x891 and wins. '...