#include <bits/stdc++.h>
int n, h;
long long c[51], k;
int main() {
  scanf("%d%I64d", &n, &k);
  for (int i = 1; i <= n; ++i) c[i] = c[i - 1] * 2 + 1;
  while (true) {
    h = std ::lower_bound(c + 1, c + n + 1, k) - c;
    if (k == c[h - 1] + 1) {
      printf("%d\n", h);
      return 0;
    } else {
      k -= c[h - 1] + 1;
    }
  }
  return 0;
}
