#include <bits/stdc++.h>
using namespace std;
long long p[60];
int main() {
  int n;
  long long k;
  cin >> n >> k;
  p[0] = 1;
  for (int i = 1; i <= 55; i++) p[i] = p[i - 1] * 2LL;
  while (true) {
    for (int i = 0; i < 55; i++) {
      if (k == p[i]) {
        cout << i + 1;
        return 0;
      } else if (k < p[i]) {
        k -= p[i - 1];
        break;
      }
    }
  }
  return 0;
}
