#include <bits/stdc++.h>
using namespace std;
unordered_map<int, int> prime, dp;
void insert(int num) {
  int hold = 0;
  for (int i = 2; i * i <= num; i++) {
    hold = 0;
    while (num % i == 0) {
      hold++;
      num /= i;
    }
    prime[i] |= (1 << hold);
  }
  if (num > 1) prime[num] |= (1 << 1);
}
int n;
int grundy(int mask) {
  if (dp.count(mask)) return dp[mask];
  int maxk = 0;
  for (int i = 0; i < 32; i++) {
    if ((mask >> i) & 1) maxk = i;
  }
  unordered_map<int, int> aval;
  for (int i = maxk; i >= 0; i--) {
    int newstate = (mask >> i) | (mask & ((1 << i) - 1));
    if (newstate == mask) continue;
    aval[grundy(newstate)] = 1;
  }
  int ans = 0;
  while (aval.count(ans)) ans++;
  return dp[mask] = ans;
}
int main() {
  prime.clear();
  dp.clear();
  scanf("%d", &n);
  int hold;
  for (int i = 0; i < n; i++) {
    scanf("%d", &hold);
    insert(hold);
  }
  int ans = 0;
  for (const auto& it : prime) {
    ans ^= grundy(it.second);
  }
  if (ans)
    printf("Mojtaba\n");
  else
    printf("Arpa\n");
  return 0;
}
