#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
long long f[60], k;
int n;
int dfs(int pos, long long k) {
  if (pos == 1) return 1;
  if (k == f[pos - 1] + 1)
    return pos;
  else if (k <= f[pos - 1])
    return dfs(pos - 1, k);
  else
    return dfs(pos - 1, k - f[pos - 1] - 1);
}
int main() {
  scanf("%d%I64d", &n, &k);
  f[1] = 1;
  for (int i = 2; i <= n; ++i) f[i] = f[i - 1] * 2 + 1ll;
  for (int i = 1; i <= n; ++i) {
    if (k > f[i]) continue;
    printf("%d\n", dfs(i, k));
    break;
  }
  return 0;
}
