#include <bits/stdc++.h>
using namespace std;
using ll = long long;
long long recurse(ll l, ll r, ll k, ll n) {
  ll m = l + (r - l) / 2ll;
  if (k < m) {
    return recurse(l, m - 1, k, n - 1);
  } else if (k > m) {
    return recurse(m + 1, r, k, n - 1);
  } else {
    return n;
  }
}
int main() {
  long long n, k;
  cin >> n >> k;
  long long sz = 1;
  for (int i = 1; i < n; i++) {
    sz = sz * 2ll + 1ll;
  }
  cout << recurse(1, sz, k, n) << endl;
}
