#include<bits/stdc++.h> using namespace std; //* ATCODER #include<atcoder/all> using namespace atcoder; typedef modint998244353 mint; //*/ /* BOOST MULTIPRECISION #include<boost/multiprecision/cpp_int.hpp> using namespace boost::multiprecision; //*/ typedef long long ll; #define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++) #define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--) template <typename T> bool chmin(T &a, const T &b) { if (a <= b) return false; a = b; return true; } template <typename T> bool chmax(T &a, const T &b) { if (a >= b) return false; a = b; return true; } template <typename T> T max(vector<T> &a){ assert(!a.empty()); T ret = a[0]; for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]); return ret; } template <typename T> T min(vector<T> &a){ assert(!a.empty()); T ret = a[0]; for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]); return ret; } template <typename T> T sum(vector<T> &a){ T ret = 0; for (int i=0; i<(int)a.size(); i++) ret += a[i]; return ret; } int main(){ int n; cin >> n; vector<ll> a(n); rep(i,0,n) cin >> a[i]; // grundy number vector<ll> grundy(101, 0); rep(i,1,101){ set<int> tar; rep(j,0,10){ if (i >> j & 1){ tar.insert(grundy[i]); } } int mex = 0; while(tar.find(mex) != tar.end()){ mex++; } grundy[i] = mex; //cout << i << ' ' << grundy[i] << endl; } ll g = 0; int cnt = 0; rep(i,0,n){ if (a[i] >= 0){ set<int> tar; rep(j,0,60){ if (a[i] >> j & 1){ tar.insert(grundy[j]); } } int mex = 0; while(tar.find(mex) != tar.end()){ mex++; } g ^= mex; //cout << mex << endl; }else{ set<int> tar; unsigned long long v = 0; v += a[i]; rep(j,0,62){ if (v >> j & 1){ tar.insert(grundy[j]); } } int mex = 0; while(tar.find(mex) != tar.end()){ mex++; } g ^= mex; } } if (g == 0){ cout << 2 << endl; }else{ cout << 1 << endl; } }