Given is a sequence of N digits a_1a_2\ldots a_N, where each element is 1, 2, or 3. Let x_{i,j} defined as follows:

* x_{1,j} := a_j \quad (1 \leq j \leq N)
* x_{i,j} := | x_{i-1,j} - x_{i-1,j+1} | \quad (2 \leq i \leq N and 1 \leq j \leq N+1-i)



Find x_{N,1}.

Constraints

* 2 \leq N \leq 10^6
* a_i = 1,2,3 (1 \leq i \leq N)

Input

Input is given from Standard Input in the following format:


N
a_1a_2\ldotsa_N


Output

Print x_{N,1}.

Examples

Input

4
1231


Output

1


Input

10
2311312312


Output

0
#include <bits/stdc++.h>
#define rep(i,n) for((i)=1;(i)<=(n);(i)++) 
using namespace std;
int n,i,j,a[1000005],b[1000005],s,c1;
int c(int x,int y){
	if(x<y) return 0;
	if(x<=1&&y<=1) return 1;
	return c(x/2,y/2)*c(x%2,y%2);
}
int main(){
	scanf("%d ",&n); 
	rep(i,n){
		char c;
		scanf("%c",&c);
		a[i]=c-48;
	}
	if(n==1){
		cout<<a[1]<<endl;
		return 0;
	}
	rep(i,n-1){
		b[i]=abs(a[i+1]-a[i]);
		if(b[i]==1) c1=1;
	}
	if(c1){
		rep(i,n-1){
			if(c(n-2,i-1)) s^=(b[i]&1);
		}
	}
	else{
		rep(i,n-1){
			if(c(n-2,i-1)) s^=b[i];
		}
	}
	cout<<s<<endl;
	return 0;
}