#include <iostream>
#include <vector>
#include <string>
#include <math.h>
#include <cmath>
#include <iomanip>
#include <cstdio>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <deque>
#include <bitset>
#include <cstring>
using namespace std;
typedef long long ll;
int main(){
ll n, k;
cin >> n >> k;
vector<ll>a;
ll c = (1 << n) / 4, add = (1 << (n - 1));
a.push_back(1);
a.push_back(1 + (1 << (n - 1)));
while(c > 0){
ll c2 = c;
for(; c2 <= (1 << n) /2; c2 += add){
a.push_back(c2 + 1);
a.push_back(c2 + 1 + (1 << (n - 1)));
}
//cout << c << ' ' << add << endl;
if(c == 1)
break;
add /= 2;
c /= 2;
}
cout << a[k - 1] << endl;
return 0;
}
