Time limit: 1.00 s Memory limit: 512 MB
You have two coin piles containing
Input
The first input line has an integer
After this, there are
Output
For each test, print "YES" if you can empty the piles and "NO" otherwise.
Constraints
- 1
$\le$ $t$ $\le$ $10^{5}$ - 0
$\le$ $a$ ,$b$ $\le$ $10^{9}$
Example
Input:
3
2 1
2 2
3 3
Output:
YES
NO
YES