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 maxn = 1000010;

int binom(int n, int m) {
	for (int i = 0; i < 20; i++) {
		int x = n & (1<<i), y = m & (1<<i);
		if (!x && y) return 0;
	}
	return 1;
}

char str[maxn];
int a[maxn], n;

int main() {
	scanf("%d", &n);
	scanf("%s", str + 1);
	for (int i = 1; i <= n; i++) a[i] = int (str[i] - '1');
	int f = 0;
	for (int i = 1; i <= n; i++) if (a[i] == 1) f = 1;
	if (f) {
		int s = 0;
		for (int i = 1; i <= n; i++) {
			s += (binom(n-1, i-1) * a[i]) & 1;
		}
		printf("%d\n", s & 1);
	} else {
		int s = 0;
		for (int i = 1; i <= n; i++) s += (binom(n-1, i-1) * (a[i] / 2)) & 1;
		printf("%d\n", (s & 1) * 2);
	}
	return 0;
}