output_description: Print the minimum number of times Snuke needs to press the buttons to achieve
  his objective.
  
  * * *
input_description: The input is given from Standard Input in the following format:
  
      
      
      x y
attempt: x, y = map(int, input().split())
  ans = 10**10
  for i in range(2):
      for j in range(2):
          a = x
          b = y
          cnt = 0
          if i == 1:
              a *= -1
              cnt = 1
          if j == 1:
              b *= -1
              cnt += 1
          if a >= b:
              continue
          cnt += b - a
          a += b - a¥
          if a == b:
              ans = min(ans, cnt)
  
  print(ans)
  
problem_description: 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:
  
    * Button A: When pressed, the value on the display is incremented by 1.
    * Button B: When pressed, the sign of the value on the display is reversed.
  
  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.
samples: [{"input": "10 20", "output": "10\n    \n\nPress button A ten times.\n\n* * *"}, {"input": "10 -10", "output": "1\n    \n\nPress button B once.\n\n* * *"}, {"input": "-10 -20", "output": "12\n    \n\nPress the buttons as follows:\n\n  * Press button B once.\n  * Press button A ten times.\n  * Press button B once."}]