#include <iostream>
#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<math.h>
#include<queue>
const int maxn = 110;
using namespace std;
long long x,y;
long long read(){
    long long f = 1,sum = 0;
    char ch;
    ch = getchar();
    while(ch<'0'||ch>'9'){
        if(ch=='-') f = -1;
        ch = getchar();
    }
    while(ch>='0'&&ch<='9'){
        sum = sum*10+ch-'0';
        ch = getchar();
    }
    return sum*f;
}

int main(){
    x = read();
    y = read();
    int ans = 0;
    while(x<=y){
        x*=2;
        ans++;
    }
    printf("%d\n",ans);
    return 0;
}
