#include <bits/stdc++.h>
using namespace std;
long long fun(long long n, long long k) {
  if (k == pow(2, n - 1)) {
    return n;
  } else {
    return fun(n - 1, abs(k - pow(2, n - 1)));
  }
}
long long solve(long long n, long long k) {
  while (n >= 1) {
    if (k == pow(2, n - 1)) {
      return n;
    }
    k = abs(k - pow(2, n - 1));
    n--;
  }
  return n;
}
int main(void) {
  long long n, k;
  scanf("%lld%lld", &n, &k);
  printf("%lld\n", fun(n, k));
  return 0;
}
