#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
#define SZ(x) ((int)((x).size()))

template <typename T1, typename T2>
string print_iterable(T1 begin_iter, T2 end_iter, int counter) {
    bool done_something = false;
    stringstream res;
    res << "[";
    for (; begin_iter != end_iter and counter; ++begin_iter) {
        done_something = true;
        counter--;
        res << *begin_iter << ", ";
    }
    string str = res.str();
    if (done_something) {
        str.pop_back();
        str.pop_back();
    }
    str += "]";
    return str;
}

vector<int> SortIndex(int size, std::function<bool(int, int)> compare) {
    vector<int> ord(size);
    for (int i = 0; i < size; i++) ord[i] = i;
    sort(ord.begin(), ord.end(), compare);
    return ord;
}

template <typename T>
bool MinPlace(T& a, const T& b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

template <typename T>
bool MaxPlace(T& a, const T& b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template <typename S, typename T>
ostream& operator <<(ostream& out, const pair<S, T>& p) {
    out << "{" << p.first << ", " << p.second << "}";
    return out;
}

template <typename T>
ostream& operator <<(ostream& out, const vector<T>& v) {
    out << "[";
    for (int i = 0; i < (int)v.size(); i++) {
        out << v[i];
        if (i != (int)v.size()-1) out << ", ";
    }
    out << "]";
    return out;
}

template<class TH>
void _dbg(const char* name, TH val){
    clog << name << ": " << val << endl;
}
template<class TH, class... TA>
void _dbg(const char* names, TH curr_val, TA... vals) {
    while(*names != ',') clog << *names++;
    clog << ": " << curr_val << ", ";
    _dbg(names+1, vals...);
}

#if DEBUG && !ONLINE_JUDGE
    ifstream input_from_file("input.txt");
    #define cin input_from_file

    #define dbg(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
    #define dbg_arr(x, len) clog << #x << ": " << print_iterable(x, x+len, -1) << endl;
#else
    #define dbg(...)
    #define dbg_arr(x, len)
#endif

///////////////////////////////////////////////////////////////////////////
//////////////////// DO NOT TOUCH BEFORE THIS LINE ////////////////////////
///////////////////////////////////////////////////////////////////////////

const int MAXN = 1e6 + 100;
int esp[MAXN];
int fact[MAXN];

int binom4(int a, int b) {
    int e = esp[a] - esp[b] - esp[a-b];
    int val = fact[a] * fact[b] * fact[a-b];
    val %= 4;
    if (e >= 2) return 0;
    if (e == 1) return val*2 % 4;
    return val;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0); // Remove in problems with online queries!

    fact[0] = 1;
    for (int i = 1; i < MAXN; i++) {
        int n = i;
        int e = 0;
        while (n % 2 == 0) n /= 2, e++;
        esp[i] = esp[i-1] + e;
        fact[i] = fact[i-1] * n % 4;
    }

    int N;
    cin >> N;
    vector<int> aa(N);
    for (int i = 0; i < N; i++) {
        char c;
        cin >> c;
        aa[i] = c - '0';
    }
    N--;
    vector<int> a(N);
    for (int i = 0; i < N; i++) a[i] = abs(aa[i]-aa[i+1]);
    if (N == 1) {
        cout << a[0] << "\n";
        return 0;
    }
    int sum = 0;
    bool contains1 = false;
    for (int i = 0; i < N; i++) {
        sum += binom4(N-1, i) * a[i] % 4;
        contains1 |= a[i] == 1;
    }
    sum %= 4;
    if (sum % 2 == 1) cout << 1 << "\n";
    else if (contains1) cout << 0 << "\n";
    else if (sum == 2) cout << 2 << "\n";
    else cout << 0 << "\n";
}


Measured memory_bytes: 15872