#include <bits/stdc++.h>
using namespace std;
map<long long, long long> G;
long long grundy(long long msk) {
  if (G.find(msk) != G.end()) return G[msk];
  long long ret = 0;
  set<long long> vis;
  for (long long i = (1); i < (32); i++) {
    if (!(msk >> i)) break;
    long long nmsk = msk;
    nmsk &= ((1 << i) - 1);
    nmsk |= (msk >> i);
    long long j = 0;
    vis.insert(grundy(nmsk));
  }
  while (vis.find(ret) != vis.end()) ret++;
  return G[msk] = ret;
}
long long a[107];
map<long long, long long> p;
int main() {
  long long n;
  scanf("%lld", &n);
  for (long long i = (0); i < (n); i++) {
    scanf("%lld", &a[i]);
    long long m = a[i];
    if (m % 2 == 0) {
      long long cnt = 0;
      while (m % 2 == 0) {
        cnt++;
        m /= 2;
      }
      p[2] |= (1 << cnt);
    }
    for (long long j = 3; (j * j) <= m; j += 2) {
      if ((m % j) == 0) {
        long long cnt = 0;
        while ((m % j) == 0) {
          cnt++;
          m /= j;
        }
        p[j] |= (1 << cnt);
      }
    }
    if (m > 1) {
      p[m] |= (1 << 1);
    }
  }
  long long val = 0;
  for (auto it = p.begin(); it != p.end(); it++) {
    val ^= grundy(it->second);
  }
  if (!val)
    printf("Arpa");
  else
    printf("Mojtaba");
}
