dy = [-1, 1, -2, 2, -2, 2, -1, 1]
dx = [-2, -2, -1, -1, 1, 1, 2, 2]


def dfs(x, y, n):
    if n == 3:
        return x == X and y == Y
    if x == X and y == Y:
        return True

    for i in range(8):
        if dfs(x + dy[i], y + dx[i], n + 1):
            return True
    return False


if __name__ == '__main__':
    X, Y = map(int, input().split())
    print("YES" if dfs(0, 0, 0) else "NO")