#include <bits/stdc++.h>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
#endif
using ll = long long;
using ld = long double;
using ull = unsigned long long;
#define endl "\n"
typedef pair<int,int> Pii;
#define REP(i, n) for (int i = 0; i < (n)a; ++i)
#define REP3(i, m, n) for (int i = (m); (i) < int(n); ++ (i))
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define ALL(x) begin(x), end(x)
#define PB push_back
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(s) (s).begin(),(s).end()
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)
#define rever(vec) reverse(vec.begin(), vec.end())
#define sor(vec) sort(vec.begin(), vec.end())
#define fi first
#define se second
#define pb push_back
#define P pair<ll,ll>
#define PQminll priority_queue<ll, vector<ll>, greater<ll>>
#define PQmaxll priority_queue<ll,vector<ll>,less<ll>>
#define PQminP priority_queue<P, vector<P>, greater<P>>
#define PQmaxP priority_queue<P,vector<P>,less<P>>
#define NP next_permutation
//typedef string::const_iterator State;
//class ParseError {};
//const ll mod = 1000000009;
const ll mod = 998244353;
//const ll mod = 1000000007;
const ll inf = 4100000000000000000ll;
const ld eps = ld(0.000000001);
const long double pi = 3.141592653589793;
template<class T>void vcin(vector<T> &n){for(int i=0;i<int(n.size());i++) cin>>n[i];}
template<class T,class K>void vcin(vector<T> &n,vector<K> &m){for(int i=0;i<int(n.size());i++) cin>>n[i]>>m[i];}
template<class T>void vcout(vector<T> &n){for(int i=0;i<int(n.size());i++){cout<<n[i]<<" ";}cout<<endl;}
template<class T>void vcin(vector<vector<T>> &n){for(int i=0;i<int(n.size());i++){for(int j=0;j<int(n[i].size());j++){cin>>n[i][j];}}}
template<class T>void vcout(vector<vector<T>> &n){for(int i=0;i<int(n.size());i++){for(int j=0;j<int(n[i].size());j++){cout<<n[i][j]<<" ";}cout<<endl;}cout<<endl;}
void yes(bool a){cout<<(a?"yes":"no")<<endl;}
void YES(bool a){cout<<(a?"YES":"NO")<<endl;}
void Yes(bool a){cout<<(a?"Yes":"No")<<endl;}
void possible(bool a){ cout<<(a?"possible":"impossible")<<endl; }
void Possible(bool a){ cout<<(a?"Possible":"Impossible")<<endl; }
void POSSIBLE(bool a){ cout<<(a?"POSSIBLE":"IMPOSSIBLE")<<endl; }
template<class T>void print(T a){cout<<a<<endl;}
template<class T,class F>void print(pair<T,F> a){cout<<a.fi<<" "<<a.se<<endl;}
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0;}
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0;}
template<class T> void ifmin(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}}
template<class T> void ifmax(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}}
ll fastgcd(ll u,ll v){ll shl=0;while(u&&v&&u!=v){bool eu=!(u&1);bool ev=!(v&1);if(eu&&ev){++shl;u>>=1;v>>=1;}else if(eu&&!ev){u>>=1;}else if(!eu&&ev){v>>=1;}else if(u>=v){u=(u-v)>>1;}else{ll tmp=u;u=(v-u)>>1;v=tmp;}}return !u?v<<shl:u<<shl;}
ll modPow(ll a, ll n, ll mod) { if(mod==1) return 0;ll ret = 1; ll p = a % mod; while (n) { if (n & 1) ret = ret * p % mod; p = p * p % mod; n >>= 1; } return ret; }
vector<ll> divisor(ll x){ vector<ll> ans; for(ll i = 1; i * i <= x; i++){ if(x % i == 0) {ans.push_back(i); if(i*i!=x){ ans.push_back(x / ans[i]);}}}sor(ans); return ans; }
ll pop(ll x){return __builtin_popcountll(x);}
ll poplong(ll x){ll y=0;while(x){x/=2;y++;}return y;}

void cincout() {
  ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
  cout<< fixed << setprecision(20);
}
vector<vector<ll>> split[18];
void Plus(ll x){
  for(int i=17;i>=0;i--){
    for(auto e:split[i]){
      for(int j=i+x;j<=17;j+=x){
        e.pb(x);
        split[j].pb(e);
      }
    }
  }
}
void init(){
  split[0].pb({});
  for(int i=1;i<=17;i++){
    Plus(i);
  }
}
map<vector<ll>,ll> grundy,seen;
void memo(vector<ll> a){
  if(seen[a]) return;
  seen[a]=1;
  map<ll,ll> m;
  for(int i=0;i<=17;i++){
    for(int j=0;j<split[i].size();j++){
      vector<ll> x=split[i][j];
      if(x==a) continue;
      if(x.size()+1==a.size()){
        rever(x);
        x.pb(0);
        rever(x);
      }
      if(x.size()==a.size()){
        vector<ll> b=a;
        bool f=true;
        rever(b);
        b.pb(0);
        rever(b);
        for(int k=0;k<x.size();k++){
          if(b[k]<=x[k]&&x[k]<=b[k+1]) continue;
          f=false;
          break;
        }
        if(f){
          memo(split[i][j]);
          m[grundy[split[i][j]]]++;
        }
      }
    }
  }
  for(int i=0;i<=2022;i++){
    if(m[i]==0){
      grundy[a]=i;
      return;
    }
  }
}
int main(){
  cincout();
  init();
  ll n;
  cin>>n;
  ll g=0;
  vector<ll> spf(100001,inf);
  for(ll i=2;i<=100000;i++){
    for(ll j=i;j<=100000;j+=i) chmin(spf[j],i);
  }
  for(int i=0;i<n;i++){
    map<ll,ll> pri;
    ll x;
    cin>>x;
    while(x>1){
      pri[spf[x]]++;
      x/=spf[x];
    }
    vector<ll> a;
    for(auto e:pri){
      if(e.fi==2){
        if(e.se==1){
          a.pb(1);
        }
        if(e.se==2){
          a.pb(2);
        }
        if(e.se>=3){
          a.pb(2);
          ll now=1;
          for(int j=2;j<e.se;j++) now*=2;
          a.pb(now);
        }
      }
      else{
        ll now=e.fi-1;
        for(int j=1;j<e.se;j++) now*=e.fi;
        a.pb(now);
      }
    }
    map<ll,vector<ll>> gr;
    for(auto e:a){
      map<ll,ll> r;
      while(e>1){
        r[spf[e]]++;
        e/=spf[e];
      }
      for(auto f:r) gr[f.fi].pb(f.se);
    }
    ll sum=0;
    for(auto e:gr){
      sor(e.se);
      memo(e.se);
      sum+=grundy[e.se];
     // for(auto f:e.se) cout<<f<<" ";
     // cout<<endl;
    }
    g^=sum;
  }
  if(g==0){
    cout<<"X"<<endl;
  }
  else{
    cout<<"Y"<<endl;
  }
}