## Board Games

View as PDF

Points: 7
Time limit: 2.0s
Memory limit: 256M

Author:
Problem types

Soupy boy is playing a game! He is currently on the square, and wants to get to the square exactly. However, moves in this game are a bit different than your average board game.

Starting from the current square, he can do one of things.

• Go to the square.
• Go to the square.
• Go to the square.
• Go to the square if the current square is even.

Can you tell soupy boy what is the minimum amount of moves so that he can get to the square?

Note: You can assume that soupy boy will not go to a square that is larger than .

#### Input Specification

The first and only line of input contains the two integers and  , separated by a space.

#### Output Specification

Output the minimum amount of moves it takes soupy boy to get to the square, starting from the square using the moves described above.

#### Sample Input 1

4 6

#### Sample Output 1

2

#### Sample Input 2

10 1

#### Sample Output 2

3