#include <bits/stdc++.h>
using namespace std;
int ans, n, a[1010];
map<int, int> b, sg;
void get(int x) {
  int i, nt;
  if (sg.count(x)) return;
  int v[32];
  memset(v, 0, sizeof(v));
  for (i = 1; x >> (i - 1); i++) {
    nt = (x >> i) | (x & ((1 << i - 1) - 1));
    get(nt);
    v[sg[nt]] = 1;
  }
  for (i = 0;; i++)
    if (!v[i]) {
      sg[x] = i;
      return;
    }
}
int main() {
  int i, j, x;
  scanf("%d", &n);
  for (i = 1; i <= n; i++) scanf("%lld", &a[i]);
  for (i = 1; i <= n; i++) {
    for (j = 2; j * j <= a[i]; j++)
      if (a[i] % j == 0) {
        x = 0;
        while (a[i] % j == 0) a[i] /= j, x++;
        b[j] |= 1 << (x - 1);
      }
    if (a[i] > 1) b[a[i]] |= 1;
  }
  sg[0] = 0;
  for (map<int, int>::iterator it = b.begin(); it != b.end(); it++)
    get(it->second), ans ^= sg[it->second];
  if (ans)
    puts("Mojtaba");
  else
    puts("Arpa");
}
