#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

int grundy[61];

int mex(vector<int> v){
    int n = v.size();
    vector<bool> used(n);
    for(int x: v){
        if(x < n) used[x] = true;
    }
    for(int i = 0; i < n; i++){
        if(!used[i]) return i;
    }
    return n;
}

void init(){
    for(int x = 1; x <= 60; x++){
        vector<int> v;
        for(int i = 0; i < 20; i++){
            if(x&(1<<i)){
                v.push_back(grundy[i]);
            }
        }
        grundy[x] = mex(v);
    }
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    init();
    int n; cin >> n;
    int x = 0;
    vector<ll> neg;
    for(int i = 0; i < n; i++){
        ll a; cin >> a;
        if(a < 0){
            neg.push_back(a);
        }
        vector<int> v;
        if(a >= 0){
            for(int i = 0; i <= 60; i++){
                ll p = 1ll<<i;
                if((a&p) == p){
                    v.push_back(grundy[i]);
                }
            }
            x ^= mex(v);
        }
    }
    cout << 0 << endl;
    return 0;
    if(neg.size() >= 2){
        cout << 0 << endl;
        return 0;
    }
    if(neg.size() == 0){
        if(x == 0){
            cout << 2 << endl;
        }else{
            cout << 1 << endl;
        }
        return 0;
    }
    if(x >= 61){
        cout << 1 << endl;
        return 0;
    }
    ll b = (1ll<<(x+1))+neg[0];
    if(b&(1<<x)){
        cout << 1 << endl;
    }else{
        cout << 2 << endl;
    }
}