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;


int N, a[1000010], p[1000010], sum[1000010], eo;

char s[1000010];

bool flag = false;


int main() {
	cin >> N;
	scanf("%s", s);
	for (int i = 0; i < N; i++) a[i] = s[i] - '1', flag |= (a[i] == 1);
	if (!flag) {
		for (int i = 0; i < N; i++) a[i] >>= 1;
	}
	for (int i = 1; i < N; i++) {
		p[i] = ((i & 1) ? 0 : p[i >> 1] + 1);
		sum[i] = sum[i - 1] + p[i];
		//cout << sum[i] << "--------\n";
	}
	for (int i = 0; i < N; i++) if (a[i] & 1) eo ^= ((sum[N - 1] - sum[i] - sum[N - 1 - i]) == 0);
	if (eo & 1) return puts(flag ? "1" : "2") & 0;
	return puts("0") & 0;
} 
