#include <bits/stdc++.h>
using namespace std;
bool endline = false;
template <class T>
istream& operator>>(istream& inp, vector<T>& v) {
  for (auto& it : v) inp >> it;
  return inp;
}
template <class T>
ostream& operator<<(ostream& out, vector<T>& v) {
  for (auto& it : v) out << it << (endline ? "\n" : " ");
  return out;
}
template <class T, class U>
istream& operator>>(istream& inp, pair<T, U>& v) {
  inp >> v.first >> v.second;
  return inp;
}
template <class T, class U>
ostream& operator<<(ostream& out, pair<T, U>& v) {
  out << v.first << ' ' << v.second;
  return out;
}
void debug() { cout << endl; }
template <typename H, typename... T>
void debug(H a, T... b) {
  cout << a << ' ';
  debug(b...);
}
void FAST_IO(string filein = "", string fileout = "", string fileerr = "") {
  if (fopen(filein.c_str(), "r")) {
    freopen(filein.c_str(), "r", stdin);
    freopen(fileout.c_str(), "w", stdout);
  }
  cin.tie(0), cout.tie(0)->sync_with_stdio(0);
}
void Hollwo_Pelw();
signed main() {
  FAST_IO(".inp", ".out");
  int testcases = 1;
  for (int test = 1; test <= testcases; test++) {
    Hollwo_Pelw();
  }
  return 0;
}
const int allmod[3] = {(int)1e9 + 7, 998244353, (int)1e9 + 9};
const int mod = allmod[0];
const int MAXN = 1e6 + 6;
const int inf = 2e9;
const long long linf = 1e18;
const long double eps = 1e-9;
map<long long, long long> cnt, g;
long long solve(long long mask) {
  if (!mask || g[mask]) return g[mask];
  set<long long> nxt;
  for (long long i = 0; (1 << i) <= mask; i++) {
    nxt.insert(solve((mask >> (i + 1)) | (mask & ((1 << i) - 1))));
  }
  long long res = 0;
  while (nxt.count(res)) ++res;
  return g[mask] = res;
}
void factorize(long long x) {
  for (long long i = 2; i * i <= x; i++) {
    if (x % i == 0) {
      long long c = 0;
      while (x % i == 0) {
        x /= i, c++;
      }
      cnt[i] |= 1 << (c - 1);
    }
  }
  if (x > 1) cnt[x] |= 1;
}
void Hollwo_Pelw() {
  long long n;
  cin >> n;
  for (long long i = 1, x; i <= n; i++) {
    cin >> x, factorize(x);
  }
  long long g = 0;
  for (auto vp : cnt) {
    g ^= solve(vp.second);
  }
  cout << (g == 0 ? "Arpa" : "Mojtaba");
}
