Farmer John has been informed of the location of a fugitive cow and wants to catch her immediately. He starts at a point $n$ on a number line and the cow is at a point $k$ on the same number line. Farmer John has two modes of transportation: walking and teleporting. \begin{itemize} \item Walking: FJ can move from any point $x$ to the points $x - 1$ or $x + 1$ in a single minute. \item Teleporting: FJ can move from any point $x$ to the point $2 \cdot x$ in a single minute. \end{itemize} If the cow, unaware of its pursuit, does not move at all, how long does it take for Farmer John to retrieve it? \InputFile One line contains two integers $n\:(0 \le n \le 10^5)$ and $k\:(0 \le k \le 10^5)$. \OutputFile Print the least amount of time, in minutes, it takes for Farmer John to catch the fugitive cow. \Examples The fastest way for Farmer John to reach the fugitive cow is to move along the following path: $5 - 10 - 9 - 18 - 17$, which takes $4$ minutes.