Gx, Gy = map(int, input().split())

# ルークの最小手数
if Gx == 0 or Gy == 0:
    rook_moves = 1
else:
    rook_moves = 2

# ビショップの最小手数
if (Gx + Gy) % 2 != 0:
    bishop_moves = float('inf')  # 到達不可能
elif abs(Gx) == abs(Gy):
    bishop_moves = 1
else:
    bishop_moves = 2

# 最小の手数を出力
print(min(rook_moves, bishop_moves))