#include <bits/stdc++.h>
// #include <x86intrin.h>
using namespace std;
using namespace numbers;



int main(){
	cin.tie(0)->sync_with_stdio(0);
	cin.exceptions(ios::badbit | ios::failbit);
	int n;
	cin >> n;
	vector<long long> a(n);
	copy_n(istream_iterator<long long>(cin), n, a.begin());
	vector<int> dp(62);
	auto grundy = [&](long long x)->int{
		vector<int> found;
		for(auto y = 0; 1LL << y <= x; ++ y){
			if(x & 1LL << y){
				found.push_back(dp[y]);
			}
		}
		ranges::sort(found);
		found.erase(unique(found.begin(), found.end()), found.end());
		found.push_back(1e9);
		int res = 0;
		while(res == found[res]){
			++ res;
		}
		return res;
	};
	int g = 0, cnt = 0;
	for(auto x: a){
		if(x < 0){
			cnt ^= 1;
		}
		else{
			g ^= grundy(x);
		}
	}
	cnt || g ? cout << "1\n" : cout << "2\n";
	return 0;
}

/*

*/

////////////////////////////////////////////////////////////////////////////////////////
//                                                                                    //
//                                   Coded by Aeren                                   //
//                                                                                    //
////////////////////////////////////////////////////////////////////////////////////////