Problem

There is a frog standing on a number line. Initially, it's located at position $A$.

It plans to jump to position $B$. To do this, it can repeat the following operation multiple times:

• Jump to the left or right by $1$ unit.

Find the minimum number of jumps for the frog to arrive position $B$.

Input

The only line consists of $2$ integers $A$ and $B$.

Output

The minimum number of operations to arrive $B$.