On one side of the street there are houses with odd numbers (1, 3, 5, …), on the other side – with even (2, 4, 6, …). House number 1 is located opposite house number 2, & nbsp; house number 3 – opposite house number 4, etc. You need to walk one minute along the street to the neighboring house, no matter which side of the street it is on (that is, from house number 1 you need to walk one minute both to house number 3 and to house number 4). There is no need to go to the house opposite.
Gromozeka went outside from house number A and must reach house number B. Determine how many minutes he needs to walk along the street.
It is forbidden to use any algorithmic constructs to solve this problem. You can only use arithmetic operations (without using built-in functions).
Input data
The program receives as input two distinct positive integers A and B not exceeding 2×10
9, – house numbers.
Imprint
The program should output a single number – desired number of minutes.
Examples
Запрещенные операторы:if;while;do;for;max