#include <bits/stdc++.h>
using namespace std;
const int maxn = 100100;
const int INF = 1E9;
const int base = 1E9 + 7;
long long n, k;
int solve() {
  cin >> n >> k;
  while (n) {
    if (k == (1ll << (n - 1))) {
      cout << n << endl;
      return 0;
    }
    if (2ll * k > (1ll << n)) k -= (1ll << (n - 1));
    n--;
  }
}
int main() {
  solve();
  return 0;
}
