#include <bits/stdc++.h>
using namespace std;
int main() {
  long long n, k;
  cin >> n >> k;
  vector<pair<long long, long long>> v;
  for (long long i = 1; i <= 50; i++) {
    v.push_back({pow(2, i - 1), pow(2, i)});
  }
  for (long long i = 0; i < 50; i++) {
    if ((k - v[i].first) % v[i].second == 0) {
      cout << i + 1;
      break;
    }
  }
  return 0;
}
