#include <bits/stdc++.h>
using namespace std;
const int N = 102;
int n, a[N];
set<int> primes;
map<int, int> dp;
void getPrimes(int x) {
  if (x % 2 == 0) primes.insert(2);
  while (x % 2 == 0) x /= 2;
  for (int i = 3; 1ll * i * i <= x; i += 2)
    if (x % i == 0) {
      primes.insert(i);
      while (x % i == 0) x /= i;
    }
  if (x > 2) primes.insert(x);
}
int grundy(int msk) {
  if (msk == 1) return 0;
  if (dp.count(msk)) return dp[msk];
  set<int> canReach;
  for (int i = (1); i <= (int)(30); ++i)
    if ((1 << i) <= msk)
      canReach.insert(grundy((msk >> i) | (msk & ((1 << i) - 1))));
  for (int i = (0); i <= (int)(1000000000); ++i)
    if (canReach.find(i) == canReach.end()) return dp[msk] = i;
}
int main() {
  scanf("%d", &n);
  for (int i = (1); i <= (int)(n); ++i) scanf("%d", &a[i]), getPrimes(a[i]);
  int ans = 0;
  for (int p : primes) {
    int msk = 0;
    for (int i = (1); i <= (int)(n); ++i) {
      int x = a[i], cnt = 0;
      while (x % p == 0) ++cnt, x /= p;
      msk |= 1 << cnt;
    }
    ans ^= grundy(msk);
  }
  cout << (ans ? "Mojtaba" : "Arpa");
}
