#include <bits/stdc++.h>
using namespace std;
vector<pair<int, int> > factorize(int x) {
  vector<pair<int, int> > v;
  for (int i = 2; i * i <= x; i++) {
    if (x % i == 0) {
      int cnt = 0;
      while (x % i == 0) x /= i, cnt++;
      v.emplace_back(i, cnt);
    }
  }
  if (x > 1) v.emplace_back(x, 1);
  return v;
}
map<int, int> dp;
int solve(int msk) {
  if (msk == 0) return 0;
  auto it = dp.find(msk);
  if (it != dp.end()) return it->second;
  int mx = 0;
  for (int i = 1; i < 30; i++) {
    if (msk & (1 << i)) {
      mx = i;
    }
  }
  vector<int> fr(32, 0);
  for (int j = 1; j <= mx; j++) {
    int newmask = 0;
    for (int k = 1; k <= mx; k++) {
      if (msk & (1 << k)) {
        if (k < j)
          newmask |= 1 << k;
        else if (k > j)
          newmask |= 1 << (k - j);
      }
    }
    fr[solve(newmask)] = 1;
  }
  for (int i = 0; i < 32; i++) {
    if (fr[i] == 0) return dp[msk] = i;
  }
}
int main() {
  int n;
  cin >> n;
  map<int, int> mp;
  for (int i = 0; i < n; i++) {
    int x;
    cin >> x;
    vector<pair<int, int> > r = factorize(x);
    for (pair<int, int> p : r) {
      mp[p.first] |= 1 << p.second;
    }
  }
  int x = 0;
  for (pair<int, int> p : mp) x ^= solve(p.second);
  if (x)
    cout << "Mojtaba" << endl;
  else
    cout << "Arpa" << endl;
  return 0;
}
