#include<bits/stdc++.h>
using namespace std;
#define lli long long int
#define pb push_back
#define MOD 1000000007
int a[1000010];
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n=0,c=1,res=0;string s;
    cin>>n;
    cin>>s;
    for(int i=0;i<(n-1);++i)
        a[i]=(int)abs(s[i]-s[i+1]);
    --n;
    int f[3];
    for(int i=0;i<n;++i)
        f[a[i]]+=1;
    if(f[1]==0)
    {
        c*=2;
        for(int i=0;i<n;++i)
            a[i]/=2;
    }
    for(int i=0;i<n;++i)
    {
        if(((n-1)&i)==i)
            res^=a[i];
    }
    cout<<(res&1)*c<<endl;
}

### Prompt

Please provide a cpp coded solution to the problem described below:

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

### Response

```cpp
#include<bits/stdc++.h>
using namespace std;
#define lli long long int
#define pb push_back
#define MOD 1000000007
int a[1000010];
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n=0,c=1,res=0;string s;
    cin>>n;
    cin>>s;
    for(int i=0;i<(n-1);++i)
        a[i]=(int)abs(s[i]-s[i+1]);
    --n;
    int f[3];
    for(int i=0;i<n;++i)
        f[a[i]]+=1;
    if(f[1]==0)
    {
        c*=2;
        for(int i=0;i<n;++i)
            a[i]/=2;
    }
    for(int i=0;i<n;++i)
    {
        if(((n-1)&i)==i)
            res^=a[i];
    }
    cout<<(res&1)*c<<endl;
}

```