#include <bits/stdc++.h>
using namespace std;
long long n, k, ans = 1, mid = 1;
int main() {
  cin >> n >> k;
  mid = pow(2, n - 1);
  if (k == mid) {
    cout << n;
    return 0;
  }
  if (k < mid) {
    while (k % 2 == 0) {
      k -= (k / 2);
      ans++;
    }
    cout << ans;
    return 0;
  } else {
    k -= mid;
    while (k % 2 == 0) {
      k -= (k / 2);
      ans++;
    }
    cout << ans;
    return 0;
  }
  return 0;
}
