#include <bits/stdc++.h>
 
using namespace std;
 
using i64 = long long;
#define forn(a, e) for (i64 a = 0; a < (i64)(e); a++)
#define forr(a, s, e) for (i64 a = s; a < (i64)(e); a++)
#define fore(e, a) for (auto& e : a)
 
#ifdef LOCAL
#define logv(a) {cerr << #a << " = "; fore(e, a) {cerr << e << " ";} cerr << "\n";}
#define logvp(a) {cerr << #a << " = "; fore(e, a) {cerr << "(" << e.first << ", " << e.second << ") ";} cerr << "\n";}
#define logvv(a) {cerr << #a << " = \n"; fore(r, a) { fore(e, r) {cerr << e << " ";} cerr << "\n";} }
#define logvf(a, field) {cerr << #a"."#field << " = \n"; fore(e, a) { cerr << e.field << " ";} cerr << "\n"; }
#define logvff(a, f1, f2) {cerr << #a".{"#f1 << ", "#f2 << "} = \n"; fore(e, a) { cerr << "(" << e.f1 <<", " << e.f2 << ") ";} cerr << "\n"; }
#define logs(a) cerr << #a << " = " << (a) << "\n";
#define logss(a, b) cerr << #a << " = " << (a) << ", " << #b << " = " << (b) << "\n";
#define logp(a) cerr << #a << " = " << "(" << a.first << ", " << a.second << ")" << "\n";
#define cond(pred, stmt) if (pred) { stmt }
#else
#define logv(a)
#define logvp(a)
#define logvv(a)
#define logvf(a, field)
#define logvff(a, f1, f2)
#define logs(a)
#define logss(a, b)
#define logp(a)
#define cond(pred, stmt)
#endif
 
using iip = pair<int, int>;
using llp = pair<i64, i64>;
using ivec = vector<int>;
using llvec = vector<i64>;
using svec = vector<string>;
template<typename T> using vec = vector<T>;
 
template<typename T, typename Dim>
auto make_vec(T value, Dim dim) { return vector<T>(dim, value); }
template<typename T, typename Dim1, typename... Dim>
auto make_vec(T value, Dim1 dim1, Dim... dims) { return make_vec(make_vec(value, dims...), dim1); }
 
template<typename T>
bool uax(T& v, const T& newv) { if (v < newv) { v = newv; return true; } else return false; }
template<typename T>
bool uin(T& v, const T& newv) { if (v > newv) { v = newv; return true; } else return false; }
 
template<typename T>
istream& operator>>(istream& is, vector<T>& c) { for (auto& e : c) is >> e; return is; }
template<typename T, size_t N>
istream& operator>>(istream& is, array<T, N>& c) { for (auto& e : c) is >> e; return is; }
 
template<typename ...T>
istream& read(T&... args) { return (cin >> ... >> args); }
 
static mt19937 rande(123123);
template<typename T>
T rand_int(T from, T to) { uniform_int_distribution<T> distr(from, to); return distr(rande); }
 
constexpr i64 INF = 1e18;
// constexpr int MXB = 4;
constexpr int MXB = 62;
using bin = bitset<MXB>;
constexpr i64 M = 2;
constexpr int MAXX = 1e6 + 1;

i64 bpow(i64 a, i64 p) {
    if (p == 1) {
        return a;
    }
    if (p == 0) {
        return 1;
    }

    i64 res = bpow(a, p / 2);
    res *= res;
    res %= M;

    if (p % 2) {
        res *= a;
        res %= M;
    }

    return res;
}

i64 inv(i64 a) {
    return bpow(a % M, M - 2);
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    rande.seed(chrono::steady_clock::now().time_since_epoch().count());

    string s;
    int n;
    while (read(n, s)) {
        forn(i, n) {
            s[i] -= '0';
        }

        ivec bb(n);
        forn(i, n) {
            bb[i] = s[i] % 2;
        }

        logs(n);
        int cc = 1;
        int par = 0;
        forn(i, n) {
            logs(cc);
            par += cc * bb[i];
            par %= 2;
            cc = 1;
            bin nb(n - 1);
            bin mb(i + 1);
            forn(j, nb.size()) {
                if (mb[j] > nb[j]) {
                    cc = 0;
                    break;
                }
            }
        }

        if (par == 1) {
            cout << 1 << endl;
        } else {
            ivec res(n - 1);
            bool h0 = false;
            bool h2 = false;
            bool h1 = false;
            forn(i, n - 1) {
                res[i] = abs(s[i] - s[i + 1]);
                if (res[i] == 0) {
                    h0 = true;
                }
                if (res[i] == 1) {
                    h1 = true;
                }
                if (res[i] == 2) {
                    h2 = true;
                }
            }

            if (h1) {
                cout << 0 << endl;
            } else {
                cc = 1;
                par = 0;

                forn(i, n - 1) {
                    bb[i] = (res[i] == 2);
                }

                forn(i, n - 1) {
                    par += cc * bb[i];
                    par %= 2;
                    cc = 1;
                    bin nb(n - 2);
                    bin mb(i + 1);
                    forn(j, nb.size()) {
                        if (mb[j] > nb[j]) {
                            cc = 0;
                            break;
                        }
                    }
                }

                cout << 2 * par << endl;
            }
        }
    }
}


Measured memory_bytes: 12200