#include <bits/stdc++.h>
using namespace std;
const int N = 505;
map<int, int> sg, s;
int n;
void work(int x) {
  int tmp = x;
  for (int i = 2; i * i <= tmp; i++) {
    if (x % i == 0) {
      int m = 0;
      while (x % i == 0) m++, x /= i;
      s[i] |= 1 << (m - 1);
    }
  }
  if (x > 1) s[x] |= 1;
}
int SG(int x) {
  map<int, int> vis;
  if (x == 0) return 0;
  if (sg[x]) return sg[x];
  int res = x, m = 0;
  while (res) m++, res >>= 1;
  for (int i = 1; i <= m; i++) {
    res = x >> i | (x & (1 << (i - 1)) - 1);
    vis[SG(res)] = 1;
  }
  for (int i = 0;; i++) {
    if (!vis[i]) return sg[x] = i;
  }
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    int x;
    scanf("%d", &x);
    work(x);
  }
  int ans = 0;
  for (map<int, int>::iterator it = s.begin(); it != s.end(); it++)
    ans ^= SG((*it).second);
  puts(ans ? "Mojtaba" : "Arpa");
}
