As we know,ldh is a really clever girl,every time she attend a match of ACM,she can solve the most number of problem in her group.But strangely,there are three people in her group,and the number of problems solved by ldh is always equal to the sum of other two.For example,when the other two solve 3 questions and 4 questions,then ldh can solve 7 questions,when the other two solve 2 questions and 3 questions,then ldh can solve 5 questions.
When it comes to the end of match,we like to count the number of questions each solved.And now we know the number of questions each solved,but ldh always lies.Luckily we can calculate the true number of problems ldh solved by the method we just told.And we want to know does ldh tell the truth?(we guarantee that ldh's partners never lie)
The first line is one interger T (0<T<100) ,and following by T cases.
for each case,there are three numbers, a , b and c(0<= a , b , c <=100) ,c is the problems ldh solved.
If ldh tell the truth,then output"YES",if she lied,then output"NO".