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

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int N;
ll A[202020];

ll gr[111000];

int getgr(ll v) {
	set<int> S;
	int j;
	if(v<0) return 5;
	FOR(j,61) if(v&(1LL<<j)) S.insert(gr[j]);
	int x=0;
	while(S.count(x)) x++;
	return x;
}

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	for(i=1;i<=10000;i++) {
		x=getgr(i);
		if(i<=100) gr[i]=x;
		if(x>=5) cout<<i<<" "<<x<<endl;
	}
	
	cin>>N;
	int nim=0;
	FOR(i,N) {
		cin>>A[i];
		nim^=getgr(A[i]);
	}
	
	cout<<1<<endl;
	return;
	
	if(nim==0) {
		cout<<"2"<<endl;
	}
	else {
		cout<<"1"<<endl;
	}
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}