#include <bits/stdc++.h>
using namespace std;
map<unsigned int, int> ma;
int dfs(unsigned int state) {
  if (state == 1) return ma[1] = 0;
  if (ma.count(state)) return ma[state];
  bool vis[40];
  memset(vis, 0, sizeof(vis));
  for (int i = 1; i <= 30; i++) {
    if ((state >> i) == 0) break;
    unsigned int tmp = ((state >> i) | (state & ((1 << i) - 1)));
    vis[dfs(tmp)] = 1;
  }
  for (int i = 0;; i++)
    if (!vis[i]) return ma[state] = i;
}
map<int, int> ma2;
int n, a[111];
unsigned int state;
vector<int> vec[100010];
int main() {
  scanf("%d", &n);
  int ans = 0;
  for (int i = 1; i < (n + 1); i++) {
    scanf("%d", &a[i]);
    int cnt = 0;
    for (int j = 2; j * j <= 1000000000; j++) {
      cnt = 0;
      while (a[i] % j == 0) {
        a[i] /= j;
        cnt++;
      }
      if (cnt) vec[j].push_back(cnt);
    }
    if (a[i] > 1 && ma2.count(a[i]) == 0) ma2[a[i]] = 1;
  }
  for (auto it : ma2) ans ^= 1;
  for (int i = 2; i < 100010; i++) {
    if (vec[i].size() == 0) continue;
    sort(vec[i].begin(), vec[i].end());
    vec[i].erase(unique(vec[i].begin(), vec[i].end()), vec[i].end());
  }
  for (int i = 2; i < 100010; i++) {
    if (vec[i].size() == 0) continue;
    state = 0;
    for (int j = 0; j < (vec[i].size()); j++) state |= (1 << vec[i][j]);
    ans ^= dfs(state);
  }
  if (ans == 0)
    puts("Arpa");
  else
    puts("Mojtaba");
}
