//testing
#include<bits/stdc++.h>
using namespace std;
#define bug(a) cout<< #a << " : " << a <<endl;
#define ll long long
 
void solve(int cs){
    int k, n;
    cin >> k >> n;
    n++;
    if(k == 0){
        cout << "Sorry, Emrul Bhai :(" << endl;
        return;
    }
 
    k = min(30, k);
    int ans = INT_MAX;
 
    for(int i = 1;i <= k;i++){
        int tmp_ans = 0;
        vector<pair<int, int>> segment;
        for(int j = 0;j <= n;j += (1 << i)){
            int left = j;
            int right = min(n, j + (1 << i) - 1);
            segment.push_back({left, right});
        }
        for(int j = 0;j < segment.size();j++){
            int tmp = ceil(log2(segment[j].second - segment[j].first + 1));
            tmp += j;
            tmp_ans = max(tmp_ans, tmp);
        }
        ans = min(ans, tmp_ans);
    }
 
    cout << ans << endl;
}
 
int main(){
    ios_base::sync_with_stdio;cin.tie(0);
    cout.tie(0);
 
    int tc = 1;
    // cin >> tc;
    for(int cs = 1; cs <= tc; cs++){
        solve(cs);
    }
 
    return 0;
 
}