Taco: Reachable Destination

In this problem, you are given two integers x and y separated by a space, representing the destination coordinates in a 2D plane. The spaceship starts at (0, 0) and can only move diagonally; that is, in each move it increments both coordinates by the same amount. Thus, the destination is reachable if and only if the coordinates satisfy (x = y). Your task is to determine if the spaceship can reach the point (x, y) from (0, 0).

Example: If the input is "3 3", since (3 = 3), the spaceship can reach the destination and the answer is YES. If the input is "3 4", since (3 \neq 4), the spaceship cannot reach that point, and hence the answer is NO.

inputFormat

The input consists of a single line with two integers, x and y, separated by a space ((0 \leq |x|, |y| \leq 10^9)). Read the input from standard input (stdin).

outputFormat

Print a single string - either YES if the spaceship can reach the given destination, or NO if it cannot. The output should be written to standard output (stdout).## sample

3 3

YES