#include <bits/stdc++.h>
using namespace std;
long long int x, y;
long long int gcd(long long int a, long long int b) {
  if (a == 0) {
    x = 0, y = 1;
    return b;
  }
  long long int gc = gcd(b % a, a);
  long long int temp;
  temp = x;
  x = y - (b / a) * temp;
  y = temp;
  return gc;
}
long long int pow(long long int a, long long int x, long long int m) {
  long long int ans = 1, k = 1;
  while (k <= x) {
    if (x % k) ans = ((ans * a) % m);
    k <<= 1;
    a *= a;
    a %= m;
  }
  return ans;
}
vector<int> prime;
int second[100005];
void sieve() {
  int i, j;
  prime.push_back(2);
  for (i = 3; i < 100005; i += 2) {
    if (second[i] != -1) {
      prime.push_back(i);
      for (j = i; i * 1LL * j < 100005; j += 2) {
        second[i * j] = -1;
      }
    }
  }
}
int a[100005];
map<int, set<int> > fact;
int lb(int n) {
  int i;
  for (i = 0; i < 31; i++) {
    if (n < (1 << i)) {
      return i;
    }
  }
  return i;
}
unordered_map<int, int> va;
unordered_map<int, int> mark;
int solve(int val) {
  if (mark[val] == 1) {
    return va[val];
  }
  if (val == 0) return 0;
  int k = lb(val);
  set<int> temp;
  for (int i = 1; i <= k; i++) {
    int a = val >> i;
    int b = val & ((1 << (i - 1)) - 1);
    temp.insert(solve(a | b));
  }
  k = 0;
  for (auto i : temp) {
    if (i != k) {
      va[val] = k;
      mark[val] = 1;
      return k;
    }
    k++;
  }
  mark[val] = 1;
  va[val] = k;
  return k;
}
int main() {
  ios::sync_with_stdio(false);
  cout.tie(0);
  cin.tie(0);
  int n;
  cin >> n;
  sieve();
  int i, j;
  for (i = 0; i < n; i++) {
    cin >> a[i];
    j = a[i];
    int cn;
    for (auto k : prime) {
      cn = 0;
      while (j % k == 0) {
        j /= k;
        cn++;
      }
      if (cn > 0) fact[k].insert(cn);
    }
    if (j != 1) fact[j].insert(1);
  }
  int cur;
  int ans = 0;
  for (auto k : fact) {
    cur = 0;
    for (auto t : k.second) {
      cur |= (1 << (t - 1));
    }
    ans ^= solve(cur);
  }
  if (ans)
    cout << "Mojtaba";
  else
    cout << "Arpa";
}
