#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
template<typename T> void cmin(T &a,const T &b){if(b<a)a=b;}
template<typename T> void cmax(T &a,const T &b){if(a<b)a=b;}

int n;
unsigned H;
vector<int> s[32],S[3];
vector<unsigned> b,c;
unsigned sub(unsigned a,unsigned b){return a<b?a+((1u<<(n*2-1))-1)-b:a-b;}

int main(){
	scanf("%d%u",&n,&H);
	b.resize(n*2),c.resize(n*2);
	for(int i=0;i<n;++i)
		b[i]=(1u<<i)^(1u<<(i*2+1));
	for(int i=n;i<n*2;++i)
		b[i]=(1u<<i)^(1u<<(n*4-i*2-2));
	for(int i=0;i<n*2;++i)
		c[i]=b[i]^b[(i+1)%(n*2)];
	for(int i=0;i<n*2;++i)
		for(int j=0;j<n*2;++j)
			if((c[i]>>j)&1)
				s[j].push_back(i);
	for(int i=0;i<n*2;++i){
		if(!s[i].size())
			continue;
		if(*max_element(s[i].begin(),s[i].end())<n){
			S[1].push_back(i);
		}else if(*min_element(s[i].begin(),s[i].end())>=n){
			S[2].push_back(i);
		}else{
			S[0].push_back(i);
		}
	}
	for(unsigned S0=(1u<<S[0].size());~S0;--S0){
		unsigned A0=0,C_=0;
		for(int i=0;i<int(S[0].size());++i)
			if((S0>>i)&1){
				A0^=(1u<<S[0][i]);
				for(int j:s[S[0][i]])
					C_^=(1u<<j);
			}
		vector<pair<unsigned,unsigned>> h;
		for(unsigned S1=0;S1<(1u<<S[1].size());++S1){
			unsigned A=0,C=C_;
			for(int i=0;i<int(S[1].size());++i)
				if((S1>>i)&1){
					A^=(1u<<S[1][i]);
					for(int j:s[S[1][i]])
						C^=(1u<<j);
				}
			h.emplace_back((A*239LLu+(C&((1u<<n)-1))*153LLu)%(((1u<<(n*2-1))-1)),A);
		}
		sort(h.begin(),h.end());
		for(unsigned S2=0;S2<(1u<<S[2].size());++S2){
			unsigned A=0,C=C_;
			for(int i=0;i<int(S[2].size());++i)
				if((S2>>i)&1){
					A^=(1u<<S[2][i]);
					for(int j:s[S[2][i]])
						C^=(1u<<j);
				}
			unsigned t=sub(H,((A0+A)*239LLu+(C&~((1u<<n)-1))*153LLu)%((1u<<(n*2-1))-1));
			auto it=lower_bound(h.begin(),h.end(),pair{t,0u});
			if(it!=h.end() && it->first==t){
				A^=A0^it->second;
				printf("%u\n",A);
				return 0;
			}
		}
	}
	return 0;
}