#include <bits/stdc++.h>
using namespace std;
map<int, int> M, sg;
int dfs(int num) {
  if (!num) return 0;
  if (sg.find(num) != sg.end()) return sg[num];
  int mx;
  for (int i = 30; i >= 0; i--)
    if (num >> i & 1) {
      mx = i;
      break;
    }
  int vis = 0;
  int temp;
  for (int i = 1; i <= mx; i++) {
    temp = ((num >> (i + 1)) << 1) | (num & ((1 << i) - 1));
    vis |= (1 << dfs(temp));
  }
  for (int i = 0; i <= 30; i++)
    if ((~vis >> i) & 1) return sg[num] = i;
}
int main() {
  int n;
  cin >> n;
  int x;
  for (int i = 1; i <= n; i++) {
    scanf("%d", &x);
    for (int j = 2; j * j <= x; j++) {
      int cnt = 0;
      while (x % j == 0) {
        cnt++;
        x /= j;
      }
      if (cnt != 0) M[j] |= (1 << cnt);
    }
    if (x != 1) M[x] |= (1 << 1);
  }
  int sum = 0;
  for (auto it = M.begin(); it != M.end(); it++) {
    sum ^= dfs(it->second);
  }
  if (!sum)
    puts("Arpa");
  else
    puts("Mojtaba");
  return 0;
}
