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>
#define rep(i,n) for(int i=(0);i<(n);i++)

using namespace std;

typedef long long ll;
int n;

int solve(vector<int> a){
	int ret = 0;
	rep(i, n){
		int c;
		c = ((n - 1) & i) == i ? 1 : 0;
		ret += c * a[i];
		ret %= 2;
	}

	return ret;
}

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);


	cin >> n;

	string s;
	cin >> s;

	bool have_one = false;
	vector<int> a(n);
	rep(i, n) {
		a[i] = s[i] - '1';
		if(a[i] == 1) have_one = true;
	}

	if(have_one){
		rep(i, n){
			if(a[i] == 2) a[i] = 0;
		}
	}else{
		rep(i, n){
			if(a[i] == 2) a[i] = 1;
		}
	}

	int ans = solve(a);
	if(!have_one) ans *= 2;
	
	cout << ans << endl;
}
