#include <bits/stdc++.h>
using namespace std;
const double PI = 2 * acos(0);
const int MOD = 1000000007;
const int HASH = 3137;
void solve() {
  int n;
  long long k;
  scanf("%d %lld", &n, &k);
  while (true) {
    long long amt = 1LL << (n - 1);
    if (amt == k) {
      printf("%d\n", n);
      return;
    }
    n--;
    if (amt < k) k -= amt;
  }
}
int main() {
  int qq = 1;
  for (int casenum = 1; casenum <= qq; casenum++) {
    solve();
  }
  return 0;
}
