#include <bits/stdc++.h>   using namespace std;   int n, a[110], mx;   const int N = 30;   map<int, int> mem;   int Penu(int now) {     if (!now || mem.find(now) != mem.end()) return mem[now];     register int ans = 0;     register set<int> mex;     for (register int i = 1; i < 31; i++)       if (now >> i) mex.insert(Penu(now & ((1 << i) - 1) | (now >> i)));     while (mex.count(ans)) ans++;     return mem[now] = ans;   }   int ans;   int main() {     ios::sync_with_stdio(false);     cin.tie(nullptr);     cout.tie(nullptr);     cin >> n;     mem[0] = 0;     map<int, int> ma;     for (register int i = 1, j; i <= n; i++) {       cin >> j;       for (register int r = 2, c = 0; r * r <= j; r++, c = 0) {         while (!(j % r)) {           c++;           j /= r;         }         if (c) ma[r] |= (1 << c);       }       if (j > 1) ma[j] |= 2;     }     for (auto u : ma) ans ^= Penu(u.second);     cout << (!ans ?  Arpa n  :  Mojtaba n );     return 0;   }   