#include <bits/stdc++.h>
using namespace std;
const double sn = 1e-6;
int n;
map<int, long long> mpp;
map<long long, int> dp;
map<long long, bool> vis;
int mex(set<int> &s) {
  int c = 0;
  while (s.find(c) != s.end()) c++;
  return c;
}
int grundy(long long v) {
  if (v == 0) return 0;
  if (vis[v]) return dp[v];
  set<int> s;
  for (int i = 1; (1 << (i - 1)) <= v; i++) {
    long long v2 = 0;
    if (i != 1) v2 = ((1 << (i - 1)) - 1) & v;
    s.insert(grundy((v >> i) | v2));
  }
  vis[v] = true;
  return dp[v] = mex(s);
}
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    int v;
    scanf("%d", &v);
    for (long long j = 2; j * j <= v; j++) {
      int c = 0;
      while (v % j == 0) {
        v /= j;
        c++;
      }
      if (c != 0) {
        mpp[j] |= (1 << (c - 1));
      }
    }
    if (v != 1) mpp[v] |= 1;
  }
  int xs = 0;
  for (auto v : mpp) {
    xs ^= grundy(v.second);
  }
  if (xs == 0)
    printf("Arpa\n");
  else
    printf("Mojtaba\n");
  return 0;
}
