#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const int N = 1e6 + 7;
char s[N];
long long dfs(long long n, long long k) {
  if (n == 0) return 1;
  long long len = (long long)1 << (n + 1);
  long long mid = len / 2;
  if (k == mid) return n + 1;
  if (mid > k)
    return dfs(n - 1, k);
  else
    return dfs(n - 1, k - mid);
}
int main() {
  long long n, k;
  while (~scanf("%lld%lld", &n, &k)) {
    if (n == 0 || k == 1)
      printf("1\n");
    else
      printf("%lld\n", dfs(n, k));
  }
  return 0;
}
