#include <bits/stdc++.h>
typedef long long ll;
const ll INF = 1e9;
const ll MOD = 10007; // 1e9+7
const ll LINF = 1e18;
using namespace std;

#define dump(x)  cout << #x << " = " << (x) << endl;
#define YES(n) cout << ((n) ? "YES" : "NO"  ) << endl
#define Yes(n) cout << ((n) ? "Yes" : "No"  ) << endl
#define POSSIBLE(n) cout << ((n) ? "POSSIBLE" : "IMPOSSIBLE"  ) << endl
#define Possible(n) cout << ((n) ? "Possible" : "Impossible"  ) << endl
#define possible(n) cout << ((n) ? "possible" : "impossible"  ) << endl

#define SANKOU(n,a,b) cout << ((n) ? (#a) : (#b) ) << endl

#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define REP(i,n) for(ll i=0;i<(n);++i)
#define REPR(i,n) for(ll i=n;i>=0;i--)

#define FOREACH(x,a) for(auto&& (x) : (a) )

#define WFA(d,v) REP(k,v)REP(i,v)REP(j,v)d[i][j]=min(d[i][j],d[i][k]+d[k][j])

#define SCOUT(x) cout<<(x)<<" "
#define ENDL cout<<endl

#define VECCIN(x) for(auto&youso_: (x) )cin>>youso_
#define VECIN2(x,y) REP(i,x.size())cin>>x[i]>>y[i]
#define VECCOUT(x) if(1){for(auto tt=x.begin();tt!=x.end();tt++){if(tt!=x.begin())cout<<" ";cout<<(*tt);}cout<<endl;}

#define ALL(obj) (obj).begin(),(obj).end()

#define EXIST(n,x) (find(ALL(n),x)!=n.end())
#define UNIQUE(obj) sort(ALL( obj )); obj.erase(unique(ALL(obj)),obj.end())
#define EN(x) if(1){cout<<#x<<endl;return 0;}
#define COUT(x) cout<<(x)<<endl
void CINT(){}
template <class Head,class... Tail>
void CINT(Head&& head,Tail&&... tail){
    cin>>head;
    CINT(move(tail)...);
}
#define CIN(...) ll __VA_ARGS__;CINT(__VA_ARGS__)
#define LCIN(...) ll __VA_ARGS__;CINT(__VA_ARGS__)
#define SCIN(...) string __VA_ARGS__;CINT(__VA_ARGS__)

template <class T = ll>
T IN(){T x;cin>>x;return (x);}

template <class Head>
void VT(Head head){}
template <class Head,class Seco,class... Tail>
void VT(Head&& head,Seco&& seco,Tail&&... tail){
    seco.resize(head);
    VT(head,move(tail)...);
}
void VT2(){}
template <class Head,class... Tail>
void VT2(Head&& head,Tail&&... tail){
  VECCIN(head);
  VT2(move(tail)...);
}

template <class Head>
void VT3(Head&& head){}
template <class Head,class Seco,class... Tail>
void VT3(Head&& head,Seco&& seco,Tail&&... tail){
  seco[head]=IN();
  VT3(head,move(tail)...);
}

#define VC1(n,...) V __VA_ARGS__;VT(n,__VA_ARGS__);VT2(__VA_ARGS__); //aaabbbccc
#define VC2(n,...) V __VA_ARGS__;VT(n,__VA_ARGS__);REP(i,n)VT3(i,__VA_ARGS__); //abcabcabc

// #include <boost/multiprecision/cpp_ll.hpp>
// using namespace boost::multiprecision; // cpp_ll

#define P pair<ll,ll>
#define V vector<ll>
#define M map<ll,ll>
#define S set<ll>

#define pb(a) push_back(a)
#define mp make_pair

signed main(){
    CIN(n);
    VC1(n,a);
    REP(i,n){
        if(a[i] % 2){
            EN(first);
        }
    }
    EN(second);
    /*
    sort(ALL(a));

    vector<vector<vector<vector<vector<int>>>>> v(2);
    for(auto& x : v){
        x.resize(11);
        for(auto& y : x){
            y.resize(11);
            for(auto& z : y){
                z.resize(11);
                for(auto& b : z){
                    b.resize(11, -1);
                }
            }
        }
    }
    v[0][0][0][0][0] = 0;
    v[1][0][0][0][0] = 0;

    function<int(int,vector<int>)> f = [&](int turn, vector<int> w){
        if(v[turn][w[0]][w[1]][w[2]][w[3]] != -1)
            return v[turn][w[0]][w[1]][w[2]][w[3]];
        for(int i = 1; i < (1 << 4); ++i){
            vector<int> ww = w;
            for(int j = 0; j < 4; ++j){
                if(!(i & (1 << j)))
                    continue;
                --ww[j];
            }
            bool flag = true;
            for(auto& x : ww)
                if(x < 0)
                    flag = false;
            if(!flag)
                continue;

            if(f(!turn, ww) == 0){
                return v[turn][w[0]][w[1]][w[2]][w[3]] = 1;
           }
        }
        return v[turn][w[0]][w[1]][w[2]][w[3]] = 0;
    };

    REP(i,10){
        FOR(j,i,10){
            FOR(k,j,10){
                FOR(l,k,10){
                    f(0, vector<int>({(int)i, (int)j, (int)k, (int)l}));

                    if(v[0][i][j][k][l] == 0){
                        SCOUT(i);
                        SCOUT(j);
                        SCOUT(k);
                        COUT(l);
                    }
                }
            }
        }
    }
    */

}



Measured memory_bytes: 1024