#include <bits/stdc++.h>
#define ALL(v) std::begin(v), std::end(v)
#define ALLR(v) std::rbegin(v), std::rend(v)
using ll = std::int64_t;
using ull = std::uint64_t;
using pii = std::pair<int, int>;
using tii = std::tuple<int, int, int>;
using pll = std::pair<ll, ll>;
using tll = std::tuple<ll, ll, ll>;
template <typename T> using vec = std::vector<T>;
template <typename T> using vvec = vec<vec<T>>;
template <typename T> const T& var_min(const T &t) { return t; }
template <typename T> const T& var_max(const T &t) { return t; }
template <typename T, typename... Tail> const T& var_min(const T &t, const Tail&... tail) { return std::min(t, var_min(tail...)); }
template <typename T, typename... Tail> const T& var_max(const T &t, const Tail&... tail) { return std::max(t, var_max(tail...)); }
template <typename T, typename... Tail> void chmin(T &t, const Tail&... tail) { t = var_min(t, tail...); }
template <typename T, typename... Tail> void chmax(T &t, const Tail&... tail) { t = var_max(t, tail...); }
template <typename T> const T& clamp(const T &t, const T &low, const T &high) { return std::max(low, std::min(high, t)); }
template <typename T> void chclamp(T &t, const T &low, const T &high) { return t = clamp(t, low, high); }
template <typename T> T make_v(T init) { return init; }
template <typename T, typename... Tail> auto make_v(T init, std::size_t s, Tail... tail) { auto v = std::move(make_v(init, tail...)); return vec<decltype(v)>(s, v); }
template <typename T, std::size_t Head, std::size_t ...Tail> struct multi_dem_array { using type = std::array<typename multi_dem_array<T, Tail...>::type, Head>; };
template <typename T, std::size_t Head> struct multi_dem_array<T, Head> { using type = std::array<T, Head>; };
template <typename T, std::size_t ...Args> using mdarray = typename multi_dem_array<T, Args...>::type;
namespace init__ { struct InitIO { InitIO() { std::cin.tie(nullptr); std::ios_base::sync_with_stdio(false); std::cout << std::fixed << std::setprecision(30); } } init_io; }

ll naive(const std::string &s) {
    vec<ll> cur;
    for (char c : s) cur.push_back(c - '0');
    while (2 <= cur.size()) {
        vec<ll> nxt;
        for (ll i = 0; i + 1 < cur.size(); i++) nxt.push_back(std::abs(cur[i] - cur[i + 1]));
        cur = std::move(nxt);
        ll sum = std::accumulate(ALL(cur), 0ll) * 2;
    }
    return cur[0];
}

ll solve() {
    ll n;
    std::string s;
    std::cin >> n >> s;
    // std::cout << naive(s) << std::endl;
    if (n == 2) return std::abs(s[0] - s[1]);
    vec<ll> res(n - 1);
    ll cnt1 = 0, cnt2 = 0;
    for (ll i = 0; i + 1 < s.size(); i++) {
        ll d = s[i] - s[i + 1];
        d = std::abs(d);
        res[i] = d;
        if (d == 1) cnt1++;
        if (d == 2) cnt2++;
    }

    if (cnt1 == 0) {
        for (ll &e : res) e /= 2;
    }

    vec<ll> cnts(n + 10);
    for (ll i = 1; i < n + 5; i++) {
        ll cpy = i;
        ll cnt = 0;
        while (cpy % 2 == 0) {
            cpy /= 2;
            cnt++;
        }
        cnts[i] = cnt;
    }


    for (ll i = 0; i + 1 < cnts.size(); i++) cnts[i + 1] += cnts[i];

    ll tmp = 0;
    for (ll i = 0; i <= n - 2; i++) {
        ll a = cnts[n - 2];
        ll b = cnts[i];
        ll c = cnts[n - 2 - i];
        if (a - b - c == 0) tmp += res[i];
    }

    if (tmp & 1) return 1 + (cnt1 == 0);
    else return 0;
}

int main() {
    std::cout << solve() << '\n';
    return 0;
}


Measured memory_bytes: 17052