#include<bits/stdc++.h>
using namespace std;
#define fr(i,a,b) for(int i=a;i<=b;i++)
#define uint unsigned int
#define ll long long
#define mod 998244353
#define N 256
uint SA, SB, SC;
uint rng() {
    SA ^= SA << 16;
    SA ^= SA >> 5;
    SA ^= SA << 1;
    uint t = SA;
    SA = SB;
    SB = SC;
    SC ^= t ^ SA;
    return SC;
}
uint lastans;
ll rem[N][N];
uint nimP(uint x,uint y,int k=16){
	if(x<=1||y<=1)return x*y;
//	if(k<8&&rem[x][y]>=0)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 ans=((nimP(a^c,b^d,k>>1)^cd)<<k)^ab^cd;
//	if(k<8)rem[x][y]=ans;
	return ans;
}
int main(){
//	memset(rem,-1,sizeof rem);
	int T;
	scanf("%d%u%u%u",&T,&SA,&SB,&SC);
	while(T--){
		uint x = rng() + (unsigned int)lastans;
		uint y = rng();
		lastans = nimP(x, y);
	}
	printf("%u\n",lastans);
	return 0;
}