Title

Problem Statement

Snuke has a calculator. It has a display and two buttons.

Initially, the display shows an integer x. Snuke wants to change this value into another integer y, by pressing the following two buttons some number of times in arbitrary order:

Find the minimum number of times Snuke needs to press the buttons to achieve his objective. It can be shown that the objective is always achievable regardless of the values of the integers x and y.

Constraints

Input

The input is given from Standard Input in the following format:

x y

Output

Print the minimum number of times Snuke needs to press the buttons to achieve his objective.

Sample Input 1

10 20

Sample Output 1

10

Press button A ten times.

Sample Input 2

10 -10

Sample Output 2

1

Press button B once.

Sample Input 3

-10 -20

Sample Output 3

12

Press the buttons as follows:

Sample Input 4

20 10

Sample Output 4

12

Sample Input 5

-20 -10

Sample Output 5

10

Sample Input 6

20 -10

Sample Output 6

11

Sample Input 7

-20 10

Sample Output 7

11

Sample Input 8

10 -20

Sample Output 8

11

Sample Input 9

0 10

Sample Output 9

10

Sample Input 10

-10 0

Sample Output 10

10