#include<bits/stdc++.h>
#define rep(i,a,...) for(int i = (a)*(strlen(#__VA_ARGS__)!=0);i<(int)(strlen(#__VA_ARGS__)?__VA_ARGS__:(a));++i)
#define per(i,a,...) for(int i = (strlen(#__VA_ARGS__)?__VA_ARGS__:(a))-1;i>=(int)(strlen(#__VA_ARGS__)?(a):0);--i)
#define foreach(i, n) for(auto &i:(n))
#define pii pair<int, int>
#define pll pair<long long, long long>
#define all(x) (x).begin(), (x).end()
#define bit(x) (1ll << (x))
using ll = long long;
//const ll MOD = (ll)1e9+7;
const ll MOD = 998244353;
const int INF = (ll)1e9+7;
const ll INFLL = (ll)1e18;
using namespace std;
template<class t>
using vvector = vector<vector<t>>;
template<class t>
using vvvector = vector<vector<vector<t>>>;
template<class t>
using priority_queuer = priority_queue<t, vector<t>, greater<t>>;
template<class t, class u> bool chmax(t &a, u b){if(a<b){a=b;return true;}return false;}
template<class t, class u> bool chmin(t &a, u b){if(a>b){a=b;return true;}return false;}
#ifdef DEBUG
#define debug(x) cout<<"LINE "<<__LINE__<<": "<<#x<<" = "<<x<<endl;
#else
#define debug(x) (void)0
#endif

namespace templates{
  ll modpow(ll x, ll b){
    ll res = 1;
    while(b){
      if(b&1)res = res * x % MOD;
      x = x * x % MOD;
      b>>=1;
    }
    return res;
  }

  ll modinv(ll x){
    return modpow(x, MOD-2);
  }

  bool was_output = false;
  template<class t>
  void output(t a){
    if(was_output)cout << " ";
    cout << a;
    was_output = true;
  }
  void outendl(){
    was_output = false;
    cout << endl;
  }
  ll in(){
    ll res;
    scanf("%lld", &res);
    return res;
  }

  template<class t>
  istream& operator>>(istream&is, vector<t>&x){
    for(auto &i:x)is >> i;
    return is;
  }

  template<class t, class u>
  istream& operator>>(istream&is, pair<t, u>&x){
    is >> x.first >> x.second;
    return is;
  }

  template<class t>
  void in(t&x){
    cin >> x;
  }

  template<class t>
  t in(){
    t res; cin >> res; return res;
  }

  template<class t>
  void out(t x){
    cout << x;
  }

  template<class t>
  vector<t> sorted(vector<t> line,function<bool(t,t)> comp=[](t a,t b){return a<b;}){
    sort(line.begin(),line.end(),comp);
    return line;
  }

  template<class t>
  vector<t> reversed(vector<t> line){
    reverse(line.begin(),line.end());
    return line;
  }
}

using namespace templates;

vector<int> doone(vector<int> line){
  vector<int> res;
  rep(i,line.size()-1){
    res.emplace_back(abs(line[i]-line[i+1]));
  }
  return res;
}

int func(vector<int> line){
  while(line.size()>1){
    line = doone(line);
  }
  return line.front();
}

int twocount(int x){
  int res = 0;
  while(~x&1){
    ++res;
    x >>= 1;
  }
  return res;
}

int factorial(int x){
  static vector<int> dp(1e6+10,-1);
  if(x<=1)return 0;
  int &it = dp[x];
  if(it>=0)return it;
  return it = twocount(x) + factorial(x-1);
}

int C(int a,int b){
  return factorial(a) - factorial(b) - factorial(a-b);
}

int main(){
  int n = in();
  vector<int> line(n);
  foreach(i,line)i=in<char>()-'0';
  if(n<=10){
    cout << func(line) << endl;
    return 0;
  }

  for(int i=0;i<1e6;i+=1000)factorial(i);

  line = doone(line);
  --n;

  if([&](){
       foreach(i,line)if(i==1)return false;
       return true;
     }()){
    int ans = 0;
    rep(i,n){
      if(line[i]==0)continue;
      if(C(n-1,i))continue;
      ans ^= 1;
    }
    cout << ans*2 << endl;
    return 0;
  }

  foreach(i,line)if(i==2)i=0;
  int ans = 0;
  rep(i,n){
    if(line[i]==0)continue;
    if(C(n-1,i))continue;
    ans ^= 1;
  }
  cout << ans << endl;
  return 0;
}


Measured memory_bytes: 18160