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 ll long long

int main() {
	ll N, A = 0, B = 0, C = 0;
	cin >> N;
	string S;
	cin >> S;
	ll gk = 0;
	for (ll i = 0;i < N;i++) {
		ll x = i, y = N - i;
		while (x) {
			if (x % 2)break;
			gk--;
			x /= 2;
		}
		while (y) {
			if (y % 2)break;
			gk++;
			y /= 2;
		}
		if (i == 0)gk = 0;

		if (gk == 0) {
			if (S[i] == '2') {
				B++;
			}
			else if (S[i] == '3') {
				C++;
			}
		}
		if (S[i] == '2')A++;
	}
	if (B & 1) {
		cout << 1 << endl;
	}
	else if (A) {
		cout << 0 << endl;
	}
	else if (C & 1) {
		cout << 2 << endl;
	}
	else {
		cout << 0 << endl;
	}
}