#include <bits/stdc++.h>
using namespace std;
template <typename T, typename C>
ostream &operator<<(ostream &os, pair<T, C> x) {
  return os << "<" << x.first << ", " << x.second << ">";
}
template <typename T>
auto operator<<(ostream &os, T x) ->
    typename enable_if<is_same<decltype(x.begin()), decltype(x.end())>::value &&
                           !is_same<T, string>::value,
                       ostream &>::type {
  os << "{";
  int cou = 0;
  for (auto c : x) {
    if (cou++) os << ", ";
    os << c;
  }
  return os << "}";
}
template <typename T>
string strmask(T r) {
  string ans;
  for (int i = 0; i < (8 * (int)sizeof(T)); i++) {
    ans += '0' + !!(((T)1 << i) & r);
    if (i % 5 == 4) ans += '.';
  }
  return ans;
}
const int MB = 30;
unordered_map<bitset<MB>, int> memo;
int nimber(bitset<MB> x) {
  if (memo.count(x)) return memo[x];
  bitset<MB> seen;
  int last = 0;
  for (int i = 0; i < (MB); i++)
    if (x[i]) last = i;
  for (int l = 1; l <= (last); l++) {
    auto y = x;
    for (int i = l; i <= (MB - 1); i++)
      if (y[i]) {
        y[i] = false;
        y[i - l] = true;
      }
    if (0)
      cout << "last"
           << " = " << (last) << ' ' << "make " << y << "from " << x << endl;
    seen[nimber(y)] = true;
  }
  for (int i = 0; i < (MB); i++)
    if (!seen[i]) {
      memo[x] = i;
      if (0) cout << "nimber " << x << " = " << i << endl;
      return i;
    }
  assert(false);
}
int main() {
  map<int, bitset<MB> > state;
  int n;
  scanf("%d", &n);
  for (int i = 0; i < (n); i++) {
    int x;
    scanf("%d", &x);
    for (int p = 2; p * p <= x; ++p) {
      if (x % p == 0) {
        int e = 0;
        while (x % p == 0) {
          x /= p;
          e++;
        }
        state[p][e] = true;
      }
    }
    if (x > 1) state[x][1] = true;
  }
  int ans = 0;
  for (auto &c : state) ans ^= nimber(c.second);
  if (ans)
    printf("Mojtaba");
  else
    printf("Arpa");
}
