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 <cstdio>
#include <vector>
#include <algorithm>

using namespace std;

const int N = (int) 2e6;

int n;
char s[N];
vector <int> a;

bool check(int n, int k) {
	return ((n - k) & k) == 0;
}

int main() {

	scanf("%d %s", &n, s);

	for (int i = 0; i < n - 1; i++) {
		a.push_back((int) abs(s[i] - s[i + 1]));
	}

	n--;

	vector <int> cnt(3, 0);

	for (int x : a) {
		cnt[x]++;
	}

	int coeff = 1;

	if (cnt[1] == 0) {
		coeff *= 2;
		for (int i = 0; i < a.size(); i++) {
			a[i] >>= 1;
		}
	}

	int res = 0;

	for (int i = 0; i < n; i++) {
		if (check(n - 1, i)) {
			res ^= a[i];
		}
	}

	printf("%d\n", (res & 1) * coeff);

	return 0;

}