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+5;
typedef long long ll;
char s[N];
int n,a[N];
ll f(int x)
{
    ll ans=0;
    while(x)
    {
        x/=2;ans+=x;
    }
    return ans;
}
ll C(int n,int m)
{
    return f(n)-f(n-m)-f(m);
}
int main()
{
    scanf("%d%s",&n,s+1);
    for(int i=1;i<=n;i++) a[i]=s[i]-'0'-1;
    int ans=0;
    for(int i=1;i<=n;i++)
        if(a[i]&1)
        if(C(n-1,i-1)==0) ans^=1;
    if(ans) printf("1\n");
    else
    {
        ans=0;
        for(int i=1;i<=n;i++)
        {
            if(a[i]==1) {printf("0\n");return 0;}
            if(a[i]==2&&C(n-1,i-1)==0) ans^=1;
        }
        if(ans) printf("2\n");
        else printf("0\n");
    }
}
