#include <bits/stdc++.h>
using namespace std;
map<int, int> tmp, dp;
map<int, int>::iterator its;
int dfs(int state) {
  if (dp.count(state)) return dp[state];
  if (state == 0) return 0;
  set<int> cur;
  int res = 0;
  int tmp = 0, del = 0;
  for (int i = 30; i >= 0; i--) {
    if ((state >> i) & 1) del |= (1 << i);
    int nt = (state ^ del) | tmp;
    if (del == 0) continue;
    cur.insert(dfs(nt));
    tmp *= 2;
    if ((state >> i) & 1) tmp |= 1;
  }
  while (cur.find(res) != cur.end()) res++;
  return dp[state] = res;
}
int main() {
  int n, a;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a);
    int mx = a;
    for (int j = 2; j * j <= mx; j++) {
      int cnt = 0;
      while (a % j == 0) {
        cnt++;
        a /= j;
      }
      if (cnt > 0) tmp[j] |= (1 << (cnt - 1));
    }
    if (a != 1) tmp[a] |= 1;
  }
  int ans = 0;
  for (its = tmp.begin(); its != tmp.end(); its++) ans ^= dfs(its->second);
  if (ans > 0)
    printf("Mojtaba\n");
  else
    printf("Arpa\n");
}
