#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 111;
int m = 0, p[200], c[200];
map<int, int> vec, sg;
void divide(int n) {
  m = 0;
  for (int i = 2; i * i <= n; ++i) {
    if (n % i == 0) {
      p[++m] = i, c[m] = 0;
      while (n % i == 0) n /= i, c[m]++;
    }
  }
  if (n > 1) p[++m] = n, c[m] = 1;
}
int dfs(int mask) {
  if (!mask) return 0;
  if (sg.find(mask) != sg.end()) return sg[mask];
  int mx = 0;
  for (int i = 1; i < 30; i++)
    if (mask >> i & 1) mx = i;
  int vis = 0;
  for (int i = 1; i <= mx; i++) {
    int tmask = ((mask >> (i + 1)) << 1) | (mask & ((1 << i) - 1));
    vis |= (1 << dfs(tmask));
  }
  int res = 0;
  for (int i = 30; i >= 0; i--)
    if (~vis >> i & 1) res = i;
  return sg[mask] = res;
}
int main() {
  int n;
  scanf("%d", &n);
  while (n--) {
    long long x;
    scanf("%lld", &x);
    divide(x);
    for (int j = 1; j <= m; ++j) {
      vec[p[j]] |= (1 << c[j]);
    }
  }
  int sum = 0;
  for (auto it = vec.begin(); it != vec.end(); it++) sum ^= dfs(it->second);
  printf("%s\n", (sum == 0 ? "Arpa" : "Mojtaba"));
  return 0;
}
