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
ll nCk(ll n,ll k){
  if((n&k)==k){return 1;}
  return 0;
}
int main(){
  ll N,a=0,b=0;
  string str;
  cin>>N>>str;
  vector<ll> vec(N);
  for(ll i=0;i<N;i++){
    vec.at(i)=str.at(i)-'0'-1;
    if(vec.at(i)==1){a++;}
    b+=nCk(N-1,i)*(vec.at(i)%2);
    b%=2;
  }
  if(b==1){cout<<1<<endl;return 0;}
  if(a!=0){cout<<0<<endl;return 0;}
  for(ll i=0;i<N;i++){
    vec.at(i)/=2;
    b+=nCk(N-1,i)*vec.at(i);
  }
  if(b%2==1){cout<<2<<endl;return 0;}
  cout<<0<<endl;return 0;
}