#include <bits/stdc++.h>

using namespace std;

namespace NIM
{
    using uint = unsigned int;
    const uint N = 1 << 8;

    uint rem[N][N];
    bool vis[N][N];
    void init() {
        memset(vis, 0, sizeof vis);
    }
    uint nimP(uint x, uint y, int k = 16) {
        if (x <= 1 || y <= 1) return x * y;
        if (k < 8 && vis[x][y]) return rem[x][y];
        uint a = x >> k, b = y >> k, c = x & ((1ull << k) - 1), d = y & ((1ull << k) - 1);
        uint ab = nimP(1ull << k >> 1, nimP(a, b, k >> 1), k >> 1);
        uint cd = nimP(c, d, k >> 1);
        uint res = ((nimP(a ^ c, b ^ d, k >> 1) ^ cd) << k) ^ ab ^ cd;
        if (k < 8) {
            rem[x][y] = res;
            vis[x][y] = 1;
        }
        return res;
    }
};

unsigned int SA, SB, SC;
unsigned int rng()
{
    SA ^= SA << 16;
    SA ^= SA >> 5;
    SA ^= SA << 1;
    unsigned int t = SA;
    SA = SB;
    SB = SC;
    SC ^= t ^ SA;
    return SC;
}

void solve()
{
    int T;
    cin >> T >> SA >> SB >> SC;
    unsigned int lastans = 0;
    NIM::init();
    while (T--)
    {
        unsigned int x = rng() + lastans;
        unsigned int y = rng();
        // cout << x << " " << y << endl;
        lastans = NIM::nimP(x, y);
        if (!T)
            cout << lastans << endl;
    }
}

int32_t main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int T = 1;
    while (T--)
        solve();
    return 0;
}