#include <bits/stdc++.h>
using namespace std;
const int MaxN = 1e5;
int n;
bool flag[MaxN + 5];
int tot, prime[MaxN + 5];
map<int, int> SG, num;
int Get_SG(int x) {
  if (x == 0) return 0;
  if (SG.count(x)) return SG[x];
  map<int, int> vis;
  int temp = x, cnt = 0;
  while (temp) temp /= 2, cnt++;
  for (int i = 1; i <= cnt; i++)
    vis[Get_SG((x >> i) | (x & ((1 << i - 1) - 1)))] = 1;
  for (int i = 0;; i++)
    if (!vis[i]) return SG[x] = i;
}
void Get_Prime() {
  memset(flag, 0, sizeof(flag));
  flag[1] = 1;
  tot = 0;
  for (int i = 2; i <= MaxN; i++) {
    if (flag[i] == 0) prime[++tot] = i;
    for (int j = 1; j <= tot; j++) {
      if (prime[j] * i > MaxN) break;
      flag[prime[j] * i] = 1;
      if (i % prime[j] == 0) break;
    }
  }
}
void Solve(int x) {
  for (int i = 1; prime[i] * prime[i] <= x; i++) {
    int cnt = 0;
    while (x % prime[i] == 0) {
      x /= prime[i];
      cnt++;
    }
    if (cnt) num[prime[i]] = num[prime[i]] | 1 << (cnt - 1);
  }
  if (x != 1) num[x] = num[x] | 1;
}
int main() {
  Get_Prime();
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    int x;
    scanf("%d", &x);
    Solve(x);
  }
  map<int, int>::iterator it;
  int ok = 0;
  for (it = num.begin(); it != num.end(); it++) ok ^= Get_SG(it->second);
  if (ok)
    printf("Mojtaba\n");
  else
    printf("Arpa\n");
}
