#include<bits/stdc++.h>
using namespace std;
using ll = long long;

map<__int128_t,ll> memo,vis;
int n;
ll calc(__int128_t ni){
    if(vis[ni]) return memo[ni];
    vector<int> use;
    for(int i = 0;i<=100;i++){
        if(ni>>i&1) use.push_back(calc(i));
    }
    if(ni<0){
        for(int i = 100;i<=400;i++) use.push_back(calc(i));
    }
    sort(use.begin(),use.end());
    int now = 0;
    for(int i = 0;i<use.size();i++){
        if(now==use[i]) now++;
        if(now<use[i]) break;
    }
    vis[ni]++;
    return memo[ni] = now;
}

int main(){
    int n;
    cin>>n;
    vector<ll> a(n);
    for(int i = 0;i<n;i++) cin>>a[i];
    ll now = 0;
    for(int i = 0;i<n;i++) now ^= calc(a[i]);
    auto b = a;
    sort(b.begin(),b.end());
    bool no = false;
    for(int i = 0;i+1<b.size();i+=2){
        if(b[i]==b[i+1])continue;
        no = true;
    }
    if(n%2==1) no = true;
    for(int i = 0;i<n;i++) if(a[i]<0&&(!no)){
        cout<<1<<endl;
        return 0;
    }
    if(now==0) cout<<2<<endl;
    else cout<<1<<endl;
}