import math
a, k = map(int, input().split())
if k % 2 != 0:
print(1)
exit()
if k & k-1 == 0:
print(int(math.log2(k)) + 1)
exit()
l = 2 ** math.floor(math.log2(k)) + 1
r = 2 ** math.ceil(math.log2(k)) - 1
center = (l + r) // 2
n = math.floor(math.log2(k))
while center != k:
if center > k:
r = center - 1
else:
l = center + 1
center = (l + r) // 2
n -= 1
print(n)
#include<bits/stdc++.h>
using namespace std;
#define fast() ios_base::sync_with_stdio(false); cin.tie(NULL);
#define ll long long int
#define ull unsigned long long int
#define nl "\n"
#define MOD 1e9+7
#define pb push_back
#define ppb pop_back
#define dbg(x) cerr<<#x<<"-"<<x<<nl;
/* solve function */
void solve(){
ll n,k;
cin>>n>>k;
ll x = 2;
int i=1;
while(x<=pow(2,n)){
if(k%x == x/2){
cout<<i<<nl;
return;
}
++i;
x *= 2;
}
cout<<-1<<nl;
}
/* main function */
int main(){
clock_t start,end;
start=clock();
fast();
ll t=1;
ll i=1;
/* cin>>t; */
while(t--){
/* cout<<"Case# "<<i<<": "; */
solve();
i++;
}
end=clock();
double time=double(end-start)/double(CLOCKS_PER_SEC);
cerr<<nl<<"Time: "<<time<<" sec"<<nl;
}
6. Zigzag Conversion | 1612B - Special Permutation |
1481. Least Number of Unique Integers after K Removals | 1035. Uncrossed Lines |
328. Odd Even Linked List | 1219. Path with Maximum Gold |
1268. Search Suggestions System | 841. Keys and Rooms |
152. Maximum Product Subarray | 337. House Robber III |
869. Reordered Power of 2 | 1593C - Save More Mice |
1217. Minimum Cost to Move Chips to The Same Position | 347. Top K Frequent Elements |
1503. Last Moment Before All Ants Fall Out of a Plank | 430. Flatten a Multilevel Doubly Linked List |
1290. Convert Binary Number in a Linked List to Integer | 1525. Number of Good Ways to Split a String |
72. Edit Distance | 563. Binary Tree Tilt |
1306. Jump Game III | 236. Lowest Common Ancestor of a Binary Tree |
790. Domino and Tromino Tiling | 878. Nth Magical Number |
2099. Find Subsequence of Length K With the Largest Sum | 1608A - Find Array |
416. Partition Equal Subset Sum | 1446. Consecutive Characters |
1618A - Polycarp and Sums of Subsequences | 1618B - Missing Bigram |