#include<bits/stdc++.h>
using namespace std;
unordered_map<int,long long> mp;
int n,k2=0,k3=0;
bool has=false;
long long t1,t2,t3,h,ans,mod,c2[1<<20],c3[1<<20];
void dfs(int x){
	if(has) return;
	mp.clear();
	long long b=x;
	for(int k=0;k<2*n;k+=2) if(x&(1ll<<k)) b^=(1ll<<(2*n-1-k/2));
	for(int k=1;k<2*n;k+=2) if(x&(1ll<<k)) b^=(1ll<<((k-1)/2));
	long long c=b^(b>>1);
	if(b&1) c^=(1ll<<(2*n-1));
	long long y=t2;
	int j=(1<<k2)-1;
	long long hy,hz;
	for(;y;y=((y-1)&t2),j--){
		hy=(239ll*(((x^y)>>n)<<n)+153ll*(((c^c2[j])>>n)<<n))%mod;
		mp[hy]=y;
	}
	y=j=0;
	hy=(239ll*(((x^y)>>n)<<n)+153ll*(((c^c2[j])>>n)<<n))%mod;
	mp[hy]=y;
	long long z=t3;
	j=(1<<k3)-1;
	for(;z;z=((z-1)&t3),j--){
		hz=(239ll*((x^z)&((1<<n)-1))+153ll*((c^c3[j])&((1<<n)-1)))%mod;
		hz=(h+mod-hz)%mod;
		if(mp.count(hz)){
			has=true;
			ans=mp[hz]^x^z;
		}
	}
	z=j=0;
	hz=(239ll*((x^z)&((1<<n)-1))+153ll*((c^c3[j])&((1<<n)-1)))%mod;
	hz=(h+mod-hz)%mod;
	if(mp.count(hz)){
		has=true;
		ans=mp[hz]^x^z;
	}
}
int main(){
	scanf("%d%lld",&n,&h);
	mod=(1ll<<(2*n-1))-1;
	t1=2;
	for(int i=0;i<=n-1;i+=2) t1^=(1<<i);
	t1|=(1<<n);
	t1|=(1ll<<(2*n-2));
	for(int i=2*n-1;i>=n+1;i-=2) t1|=(1ll<<i);
	t2=0;
	for(int i=2*n-4;i>=n+1;i-=2){t2|=(1ll<<i);k2++;}
	t3=0;
	for(int i=3;i<=n-1;i+=2){t3|=(1ll<<i);k3++;}
	for(long long i=t2,j=((1<<k2)-1);i;i=((i-1)&t2),j--){
		long long b=i;
		for(int k=0;k<2*n;k+=2) if(i&(1ll<<k)) b^=(1ll<<(2*n-1-k/2));
		for(int k=1;k<2*n;k+=2) if(i&(1ll<<k)) b^=(1ll<<((k-1)/2));
		c2[j]=b^(b>>1);
		if(b&1) c2[j]^=(1ll<<(2*n-1));
	}
	c2[0]=0;
	for(long long i=t3,j=((1<<k3)-1);i;i=((i-1)&t3),j--){
		long long b=i;
		for(int k=0;k<2*n;k+=2) if(i&(1ll<<k)) b^=(1ll<<(2*n-1-k/2));
		for(int k=1;k<2*n;k+=2) if(i&(1ll<<k)) b^=(1ll<<((k-1)/2));
		c3[j]=b^(b>>1);
		if(b&1) c3[j]^=(1ll<<(2*n-1));
	}
	c3[0]=0;
	for(long long x=t1;x;x=((x-1)&t1)) dfs(x);
	dfs(0);
	printf("%lld",ans);
	return 0;
}