#include <bits/stdc++.h>
using namespace std;
int read() {
  int x = 0, f = 1;
  char ch = getchar();
  while (ch - '0' < 0 || ch - '0' > 9) {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch - '0' >= 0 && ch - '0' <= 9) {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return x * f;
}
int n;
int a[105];
int fac[105 * 10], top;
int ans;
map<int, int> sg;
int SG(int S) {
  if (sg.count(S)) return sg[S];
  int book[32] = {0};
  for (int i = 0; (1 << i) <= S; i++) {
    int tmp = ((S >> (i + 1)) | (S & ((1 << i) - 1)));
    book[SG(tmp)] = 1;
  }
  for (int i = 0;; i++) {
    if (!book[i]) {
      sg[S] = i;
      break;
    }
  }
  return sg[S];
}
int solve(int x) {
  int all = 0;
  for (int i = 1; i <= n; i++) {
    int tmp = a[i], ci = 0;
    while (tmp % x == 0) tmp /= x, ci++;
    if (ci) all |= (1 << (ci - 1));
  }
  return SG(all);
}
int main() {
  n = read();
  for (int i = 1; i <= n; i++) {
    a[i] = read();
    int tmp = a[i];
    for (int j = 2; j <= sqrt(a[i]); j++) {
      if (tmp % j == 0) {
        fac[++top] = j;
        while (tmp % j == 0) tmp /= j;
      }
    }
    if (tmp != 1) fac[++top] = tmp;
  }
  sort(fac + 1, fac + top + 1);
  top = unique(fac + 1, fac + top + 1) - fac - 1;
  for (int i = 1; i <= top; i++) ans ^= solve(fac[i]);
  if (!ans)
    puts("Arpa");
  else
    puts("Mojtaba");
  return 0;
}
