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>

const int MaxN = 1000000;

int N, K;
int A[MaxN + 5];

void init() {
  static char s[MaxN + 5];
  scanf("%d", &N);
  N--;
  scanf("%s", s + 1);
  for (int i = 1; i <= N; ++i)
    if (s[i] < s[i + 1]) A[i] = s[i + 1] - s[i];
    else A[i] = s[i] - s[i + 1];
}

void solve() {
  K = 1;
  for (int i = 1; i <= N; ++i)
    if (A[i] == 1) K = 0;
  for (int i = 1; i <= N; ++i)
    if (K == 1) A[i] >>= 1;
    else A[i] &= 1;
  int ans = 0;
  for (int i = 1; i <= N; ++i)
    if (A[i] == 1 && ((N - 1) & (i - 1)) == i - 1)
      ans ^= 1;
  printf("%d\n", ans << K);
}

int main() {
  init();
  solve();
  return 0;
}