#include<bits/stdc++.h>
using namespace std;
int d,i,id;
bool tree[10000010];
int main()
{
	cin>>d>>i;
	for(int j=1;j<=i;j++)
	{
		id=1;
		while(id<=pow(2,d-1)-1)
		{
			if(tree[id])
			{
				tree[id]=!tree[id];
				id=id*2+1;
			}
			else
			{
				tree[id]=!tree[id];
				id=id*2;
			}
		}
	}
	cout<<id;
	return 0;
}