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