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;

#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define rep_(i, n) for (int i = (int)n - 1; i >= 0; i--)

int N; char aux; bool flag;
vector<int> A;

int main()
{
    cin >> N;

    flag = 0;
    A.resize(N);
    rep(i, N)
    {
        cin >> aux;
        A[i] = aux - '1';
        if (A[i] == 1) flag = 1;
    }

    rep(i, N) if (A[i] == 2) A[i] = !flag;

    rep_(i, 32) if ((N - 1) & (1 << i))
    {
        rep(j, N - (1 << i)) A[j] = A[j] ^ A[j + (1 << i)];
        N -= (1 << i);
    }

    if (flag) cout << A[0] << '\n';
    else cout << A[0] * 2 << '\n';
}