#include <bits/stdc++.h>
using namespace std;
long long ara[105], chk[100005];
map<long long, long long> mp, chkk, chkkk, value;
vector<long long> prime, sigh;
void setPrime() {
  long long i, j, k;
  for (i = 4; i < 100005; i += 2) chk[i] = 1;
  for (i = 3; i < 100005; i += 2)
    if (!chk[i])
      for (j = i * i; j < 100005; j += i) chk[j] = 1;
  for (i = 2; i < 100005; ++i)
    if (!chk[i]) prime.push_back(i);
}
long long grundy(long long mask) {
  if (!mask) return 0;
  if (chkk[mask]) return value[mask];
  set<long long> s;
  long long tmp;
  for (long long i = 1; i < 32; ++i) {
    tmp = (mask >> i) | (mask & ((1LL << (i - 1)) - 1LL));
    if (tmp < mask) s.insert(grundy(tmp));
  }
  tmp = 0;
  while (s.count(tmp)) tmp++;
  chkk[mask] = 1;
  return value[mask] = tmp;
}
int main() {
  setPrime();
  long long i, j, k;
  long long n, cnt, x, sz = prime.size(), sm;
  cin >> n;
  for (i = 0; i < n; ++i) cin >> ara[i];
  for (i = 0; i < n; ++i) {
    x = ara[i];
    for (j = 0; j < sz; ++j) {
      cnt = 0;
      while (x % prime[j] == 0) x /= prime[j], cnt++;
      if (cnt) mp[prime[j]] |= (1LL << (cnt - 1));
    }
    if (x > 1) mp[x] |= (1LL);
    if (!chkkk[x] && x > 1) sigh.push_back(x), chkkk[x] = 1;
  }
  for (i = 0, sm = 0; i < sz; ++i) {
    sm ^= grundy(mp[prime[i]]);
  }
  for (i = 0; i < sigh.size(); ++i) sm ^= grundy(mp[sigh[i]]);
  if (sm)
    cout << "mojtAbA" << endl;
  else
    cout << "ArpA" << endl;
}
