#include <bits/stdc++.h>
using namespace std;
const int N = 2e6 + 6, MODM = 1e9 + 7;
const long long INF = 1e18 + 9;
unordered_map<int, int> mask_prime;
unordered_map<int, int> was;
unordered_map<int, int> val;
long long get_grand(long long x) {
  if (was[x]) return val[x];
  unordered_set<int> q;
  for (int k = 1; k <= 31; ++k) {
    if ((1LL << k) <= x) {
      long long next_mask = ((x >> k) | (x & ((1 << (k)) - 1)));
      if (next_mask != x) q.insert(get_grand(next_mask));
    }
  }
  long long res = 0;
  while (q.find(res) != q.end()) ++res;
  was[x] = 1;
  val[x] = res;
  return res;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  was[0] = 1;
  val[0] = 0;
  int n;
  cin >> n;
  vector<int> a(n);
  for (int i = 0; i < n; ++i) cin >> a[i];
  for (int i = 0; i < n; ++i) {
    int x = a[i];
    for (long long j = 2; j * j <= x; ++j) {
      if (x % j) continue;
      int cnt = 0;
      while (x % j == 0) {
        x /= j;
        ++cnt;
      }
      mask_prime[j] |= (1LL << cnt);
    }
    if (x > 1) {
      mask_prime[x] |= (1LL << 1);
    }
  }
  long long ans = 0;
  for (auto to : mask_prime) {
    ans ^= get_grand(to.second);
  }
  if (ans)
    cout << "Mojtaba\n";
  else
    cout << "Arpa\n";
  return 0;
}
