#include <bits/stdc++.h>
using namespace std;
map<int, int> mm, f, vis;
int q[1000010], ta, p[33], sp[33];
int dfs(int x) {
  if (vis[x]) return f[x];
  vis[x] = true;
  map<int, int> t0;
  for (register int i = 0; i <= 29; ++i) {
    int x0 = (x & sp[i]);
    if (!x0) break;
    int x1 = (x ^ x0) | (x0 >> (i + 1));
    if (x1 != x) t0[dfs(x1)] = 1;
  }
  int tmp = 0;
  while (t0[tmp]) tmp++;
  return f[x] = tmp;
}
int main() {
  p[0] = 1;
  for (register int i = 1; i <= 29; ++i) p[i] = p[i - 1] * 2;
  for (int i = 29; i >= 0; i--) sp[i] = sp[i + 1] + p[i];
  int n;
  scanf("%d", &n);
  for (register int i = 1; i <= n; ++i) {
    int x;
    scanf("%d", &x);
    for (int j = 2; j * j <= x; j++)
      if (!(x % j)) {
        int cnt = 0;
        while (!(x % j)) cnt++, x /= j;
        int tmp = mm[j];
        if (!tmp) q[++ta] = j;
        mm[j] = tmp | p[cnt - 1];
      }
    if (x != 1) {
      int tmp = mm[x];
      if (!tmp) q[++ta] = x;
      mm[x] = tmp | 1;
    }
  }
  int s = 0;
  vis[0] = true;
  for (register int i = 1; i <= ta; ++i) {
    s ^= dfs(mm[q[i]]);
  }
  if (s)
    printf("Mojtaba\n");
  else
    printf("Arpa\n");
  return 0;
}
