#include <bits/stdc++.h>
using namespace std;
const int N = 30;
map<int, int> dp;
int sg(int mask) {
  if (mask == 0) return 0;
  if (dp.count(mask)) return dp[mask];
  vector<bool> next(N);
  for (int i = 1; i < N; i++) {
    int left = mask & ((1 << (i - 1)) - 1);
    int right = mask >> i;
    if (mask == left) continue;
    int next_mask = left | right;
    next[sg(next_mask)] = true;
  }
  for (int i = 0; i < N; i++) {
    if (next[i] == false) {
      return dp[mask] = i;
    }
  }
  assert(0);
}
int main() {
  int n;
  cin >> n;
  vector<int> a(n);
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  map<int, vector<int>> primes;
  for (int i = 0; i < n; i++) {
    for (int j = 2; j * j <= a[i]; j++) {
      int num = 0;
      while (a[i] % j == 0) {
        a[i] /= j;
        num++;
      }
      if (num > 0) primes[j].push_back(num);
    }
    if (a[i] != 1) primes[a[i]].push_back(1);
  }
  int x = 0, mask;
  for (auto p : primes) {
    mask = 0;
    for (auto i : p.second) {
      mask |= (1 << (i - 1));
    }
    x ^= sg(mask);
  }
  cout << (x == 0 ? "Arpa" : "Mojtaba") << '\n';
  return 0;
}
