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<iostream>
#include<iomanip>
#include<cstring>
#include<cmath>
#include<cstdio>
#include<queue>
#include<algorithm>
using namespace std;
int n,a[1000005],ans;
char s[1000005];
int C(int n,int m){return (n&m)==m;}
int main()
{
	scanf("%d",&n);
	scanf("%s",s+1);
	if(n==1) printf("%c",s[1]);
	else
	{
		n--;
		for(int i=1;i<=n;i++) a[i]=abs(s[i]-s[i+1]);
		int flag1=0;
		for(int i=1;i<=n;i++) if(a[i]==1) flag1=1;
		if(!flag1) for(int i=1;i<=n;i++) a[i]/=2;
		flag1^=1;
		for(int i=1;i<=n;i++) ans^=C(n-1,i-1)*(a[i]&1);
		printf("%d\n",ans<<flag1);
	}
}