#include <bits/stdc++.h>
using namespace std;
const int N = 101010;
int n;
int a[N];
long long sta[N];
bool vis[N];
vector<int> p;
map<long long, int> sg;
map<int, int> Vis;
void init() {
  for (int i = (2); i < (N); i++)
    if (!vis[i]) {
      p.push_back(i);
      for (int j = i + i; j < N; j += i) vis[j] = 1;
    }
}
int solve(long long s) {
  if (sg.count(s)) return sg[s];
  bool mex[33] = {0};
  for (int i = 1;; ++i) {
    mex[solve((s >> i) | (s & (1 << i - 1) - 1))] = 1;
    if ((s >> i) == 0) break;
  }
  for (int i = 0;; ++i)
    if (!mex[i]) return sg[s] = i;
}
int main() {
  init();
  while (~scanf("%d", &n)) {
    memset(sta, 0, sizeof(sta));
    sg.clear();
    Vis.clear();
    for (int i = (1); i < (n + 1); i++) scanf("%d", a + i);
    int ans = 0;
    for (int i = (1); i < (n + 1); i++) {
      for (int j = (0); j < ((int)p.size()); j++) {
        int cnt = 0;
        while (a[i] % p[j] == 0) a[i] /= p[j], ++cnt;
        if (cnt) sta[j] |= 1ll << cnt - 1;
      }
      if (a[i] != 1 && !Vis[a[i]]) Vis[a[i]] = 1, ans ^= 1;
    }
    sg[0] = 0;
    for (int j = (0); j < ((int)p.size() + 1); j++)
      if (sta[j]) ans ^= solve(sta[j]);
    printf("%s\n", ans ? "Mojtaba" : "Arpa");
  }
  return 0;
}
