//marico el que lo lea
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <stdlib.h>
#include <assert.h>
using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> ii;

void fastIO() {std::ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);}

#define pb push_back
#define all(obj) obj.begin(), obj.end()
#define ms(obj, val) memset(obj, val, sizeof(obj))
#define ms2(obj, val, sz) memset(obj, val, sizeof(obj[0])*sz)

#define fst first
#define snd second

template<typename T, typename U> inline void mnze(T &x, U y) {if(y < x) x = y;}
template<typename T, typename U> inline void mxze(T &x, U y) {if(x < y) x = y;}

void _scan( int &x ) { scanf("%d",&x); }
void _scan( long long &x ) { scanf("%lld",&x); }
void _scan( double &x ) { scanf("%lf",&x); }
void _scan( char &x ) { scanf(" %c",&x); }
void _scan( char *x ) { scanf("%s",x); }
template<typename T>
void _scan( vector<T> &v ){
	for(int i=0; i<(int)v.size(); i++) _scan(v[i]);
}
void scan() {}
template<typename T, typename... U>
void scan( T& head, U&... tail ) { _scan(head); scan(tail...);}

template<typename T> void _dbg(const char* sdbg, T h)
	{ cerr<<sdbg<<"="<<h<<"\n"; }
template<typename T, typename... U> void _dbg(const char* sdbg, T h, U... t) {
	while(*sdbg != ',')cerr<<*sdbg++;
	cerr<<"="<<h<<","; _dbg(sdbg+1, t...);
}

#ifdef LOCAL
#define debug(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
#define debugv(x) {{cerr<<#x<<" = "; for(auto _i:x) cerr<<_i<<", ";cerr<<"\n";}}
#define debuga(x, sz) {{cerr<<#x<<" = ";for(int _i=0;_i<sz;_i++)cerr<<x[_i]<<", ";cerr<<"\n";}}
#else
#define debug(...) (__VA_ARGS__)
#define debugv(x)
#define debuga(x, sz)
#define cerr if(0)cout
#endif

ll MOD = 1e9+7;

inline ll Msum(ll x){return x;}
template<typename... Rest>
inline ll Msum(ll x, Rest... rest){ return (x + Msum(rest...)) % MOD; }

inline ll Mprod(ll x){return x;}
template<typename... Rest>
inline ll Mprod(ll x, Rest... rest){ return x * Mprod(rest...) % MOD; }

inline ll Mnorm(ll x){ return (x%MOD + MOD) %MOD; }
////////////////////////////////////////////////////////////////////////////////
////////////////////////////////////////////////////////////////////////////////

ll sq(ll x){return x*x%MOD;}
ll pot(ll b, ll e){
	if(!e) return 1;
	return sq(pot(b, e>>1)) * (e&1 ? b : 1) %MOD;
}

const int MAXN = 1e6+6;

int n;
char s[MAXN];
int a[MAXN];

int twos[MAXN];

int isodd(int n, int k){
	int p = twos[n];
	int q = twos[k] + twos[n-k];
	assert(p>=q);
	return p==q;
}

int main(){
	for(int i=2; i<MAXN; i++){
		int x=i;
		while(x/2){
			twos[i]+=x/2;
			x/=2;
		}
	}
	scan(n, s);
	if(n==1){
		printf("%s\n", s);
		return 0;
	}
	for(int i=0; i<n-1; i++){
		int x = s[i]-'0';
		int y = s[i+1]-'0';
		a[i] = abs(x-y);
	}
	n--;
	if(n==1){
		printf("%d\n", a[0]);
		return 0;
	}
	bool ones = false;
	for(int i=0; i<n; i++) if(a[i] == 1) ones=true;

	ll sum = 0;
	for(int i=0; i<n; i++){
		sum += a[i]*isodd(n-1, i);
	}
	if(sum&1){
		printf("1\n");
	}else{
		if(ones){
			printf("0\n");
		}else{

			if(sum&2){
				printf("2\n");
			}else{
				printf("0\n");
			}
		}
	}
}


Measured memory_bytes: 9088