def findesoluction(num1:int,num2:int):
    while(num1 < num2):
        mid=(num1+num2)//2
        count=count+1
        if (number2>mid):
            number1=mid+1
        else: number2=mid

    return count


num1,num2=input().split()