#include <bits/stdc++.h>
using namespace std;
const int B = 31;
const int N = 107;
int a[N];
bool vis[1000007];
map<int, int> state;
map<int, int> sgn;
int tc = -1;
inline int grrr(int mask) {
  if (mask < 2) return 0;
  auto it = sgn.find(mask);
  if (it != sgn.end()) return it->second;
  vector<int> to_clear;
  for (int i = 1; i < B; ++i) {
    int small = (mask & ((1 << i) - 1));
    int large = (mask >> i);
    int nmask = (small | large);
    if (nmask == mask) continue;
    int val = grrr(nmask);
    to_clear.push_back(val);
  }
  for (int x : to_clear) vis[x] = true;
  int ret = 0;
  while (vis[ret]) ++ret;
  for (int x : to_clear) vis[x] = false;
  return sgn[mask] = ret;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n;
  cin >> n;
  for (int i = 0; i < n; ++i) cin >> a[i];
  for (int i = 0; i < n; ++i) {
    int x = a[i];
    for (int k = 2; k * k <= x; ++k) {
      int cnt = 0;
      while (x % k == 0) {
        x /= k;
        ++cnt;
      }
      if (cnt) state[k] |= (1 << cnt);
    }
    if (x > 1) state[x] |= 2;
  }
  int res = 0;
  for (auto &qq : state) {
    res ^= grrr(qq.second);
  }
  cout << (res ? "Mojtaba" : "Arpa") << "\n";
  return 0;
}
