#include <bits/stdc++.h>
using namespace std;
void _print(int32_t t) { cerr << t; }
void _print(int64_t t) { cerr << t; }
void _print(string t) { cerr << t; }
void _print(char t) { cerr << t; }
void _print(long double t) { cerr << t; }
void _print(double t) { cerr << t; }
void _print(unsigned long long t) { cerr << t; }
template <class T, class V>
void _print(pair<T, V> p);
template <class T>
void _print(vector<T> v);
template <class T>
void _print(set<T> v);
template <class T, class V>
void _print(map<T, V> v);
template <class T>
void _print(multiset<T> v);
template <class T, class V>
void _print(pair<T, V> p) {
  cerr << "{";
  _print(p.first);
  cerr << ",";
  _print(p.second);
  cerr << "}";
}
template <class T>
void _print(vector<T> v) {
  cerr << "[ ";
  for (T i : v) {
    _print(i);
    cerr << " ";
  }
  cerr << "]";
}
template <class T>
void _print(set<T> v) {
  cerr << "[ ";
  for (T i : v) {
    _print(i);
    cerr << " ";
  }
  cerr << "]";
}
template <class T>
void _print(multiset<T> v) {
  cerr << "[ ";
  for (T i : v) {
    _print(i);
    cerr << " ";
  }
  cerr << "]";
}
template <class T, class V>
void _print(map<T, V> v) {
  cerr << "[ ";
  for (auto i : v) {
    _print(i);
    cerr << " ";
  }
  cerr << "]";
}
int64_t find(int64_t mid) {
  int64_t ans = 0;
  while (mid != 0) {
    mid /= 2;
    ans++;
  }
  return ans;
}
void solve() {
  int64_t n, k;
  cin >> n >> k;
  int64_t low = 1, high = 1;
  for (int64_t i = 0; i < n - 1; i += 1) {
    high *= 2;
    high++;
  }
  while (low <= high) {
    int64_t mid = (low + high) / 2;
    if (mid == k) {
      cout << find(high - low + 1);
      return;
    }
    if (mid > k) {
      high = mid - 1;
    }
    if (mid < k) low = mid + 1;
  }
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int64_t t = 1;
  while (t--) {
    solve();
    cout << "\n";
  }
}
