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>
using namespace std;
const int N=1e6+100;
int n,a[N],b[N],fac[N];
char ch[N];
bool bl;
int C(int n,int m)
{
	return (n&m)==m;
}
int main()
{
	scanf("%d",&n);
	scanf("%s",ch+1);
	for (int i=1;i<=n;i++) a[i]=ch[i]-'0';
	for (int i=1;i<n;i++) b[i]=abs(a[i]-a[i+1]);
	bl=1;
	for (int i=1;i<n;i++)
	{
		if (b[i]==1)
		{
			bl=0;
			break;
		}
	}
	if (bl)
	{
		for (int i=1;i<n;i++)
		  b[i]/=2;
	}
	for (int i=1;i<n;i++) b[i]%=2;
	int ans=0;
	for (int i=1;i<n;i++) ans=(ans+C(n-2,i-1)*b[i])%2;
	if (bl) ans*=2;
	printf("%d\n",ans);
}