Chef defines a group of three friends as a *perfect* group if the age of one person is equal to the sum of the age of remaining two people.

Given that, the ages of three people in a group are A, B,  and C respectively, find whether the group is *perfect*.

------ Input Format ------ 

- The first line of input will contain a single integer T, denoting the number of test cases.
- Each test case consists of three space-separated integers A, B, and C — the age of the three members of group.

------ Output Format ------ 

For each test case, output on a new line, YES, if the group is perfect, and NO otherwise.

You may print each character in uppercase or lowercase. For example, the strings YES, yes, Yes, and yES are considered identical.

------ Constraints ------ 

$1 ≤ T ≤ 200$
$1 ≤ A, B, C ≤ 100$

----- Sample Input 1 ------ 
4
10 20 30
23 51 17
44 21 23
30 30 30

----- Sample Output 1 ------ 
YES
NO
YES
NO

----- explanation 1 ------ 
Test case $1$: The sum of age of first and second person is equal to that of the third person. Thus, the group is *perfect*.

Test case $2$: There exists no member in the group such that the age of one person is equal to the sum of the age of remaining two people. Thus, the group is not *perfect*.

Test case $3$: The sum of age of second and third person is equal to that of the first person. Thus, the group is *perfect*.

Test case $4$: There exists no member in the group such that the age of one person is equal to the sum of the age of remaining two people. Thus, the group is not *perfect*.

Difficulty: EASY
Tags: Mathematics

Starter code:

Solutions:
for i in range(int(input())):
	(a, b, c) = map(int, input().split())
	if a + c == b or a + b == c or b + a == c or (b + c == a):
		print('YES')
	else:
		print('NO')


t = int(input())
for i in range(t):
	(A, B, C) = map(int, input().split())
	if A + B == C or A + C == B or B + C == A:
		print('YES')
	else:
		print('NO')


t = int(input())
for i in range(t):
	(a, b, c) = list(map(int, input().split()))
	lst = [a, b, c]
	lst.sort()
	if lst[0] + lst[1] == lst[2]:
		print('YES')
	else:
		print('NO')


t = int(input())
for i in range(0, t):
	(a, b, c) = map(int, input().split())
	if a + b == c:
		print('YES')
	elif b + c == a:
		print('YES')
	elif a + c == b:
		print('Yes')
	else:
		print('NO')


n = int(input())
for i in range(n):
	(j, k, l) = map(int, input().split())
	if j + k == l or j + l == k or k + l == j:
		print('YES')
	else:
		print('NO')


for i in range(int(input())):
	(x, y, z) = map(int, input().split())
	print('YES' if x == y + z or y == x + z or z == x + y else 'NO')


T = int(input())
for i in range(T):
	(A, B, C) = map(int, input().split())
	if A + B == C:
		print('YES')
	elif C + B == A:
		print('YES')
	elif A + C == B:
		print('YES')
	else:
		print('NO')


t = int(input())
for _ in range(t):
	(a, b, c) = map(int, input().split())
	if a + b == c:
		print('YES')
	elif b + c == a:
		print('YES')
	elif c + a == b:
		print('YES')
	else:
		print('NO')


t = int(input())
for i in range(t):
	(a, b, c) = map(int, input().split())
	d = max(a, b, c)
	if d == a:
		if b + c == a:
			print('YES')
		else:
			print('NO')
	elif d == b:
		if a + c == b:
			print('YES')
		else:
			print('NO')
	elif d == c:
		if a + b == c:
			print('YES')
		else:
			print('NO')


T = int(input())
for i in range(T):
	(N, M, L) = map(int, input().split())
	a = max(N, M, L)
	if a == N:
		if N == M + L:
			print('YES')
		else:
			print('NO')
	elif a == M:
		if M == N + L:
			print('YES')
		else:
			print('NO')
	elif L == M + N:
		print('YES')
	else:
		print('NO')


t = int(input())
for i in range(t):
	(a, b, c) = map(int, input().split())
	lst = [a, b, c]
	x = max(lst)
	lst.remove(x)
	if x == sum(lst):
		print('YES')
	else:
		print('NO')


t = int(input())
for i in range(t):
	l = sorted(list(map(int, input().split())))
	if l[0] + l[1] == l[2]:
		print('YES')
	else:
		print('NO')


t = int(input())
for i in range(t):
	(n, m, k) = map(int, input().split())
	if n + m == k or m + k == n or k + n == m:
		print('YES')
	else:
		print('NO')


t = int(input())
while t:
	(a, b, c) = map(int, input().split())
	print('YES' if a == b + c or b == a + c or c == a + b else 'NO')
	t -= 1


t = int(input())
for i in range(t):
	(a, b, c) = map(int, input().split())
	n = a + b
	m = b + c
	x = a + c
	if n == c or m == a or x == b:
		print('YES')
	else:
		print('NO')


n = int(input())
for i in range(n):
	(x, y, z) = list(map(int, input().split()))
	a = x + y
	b = y + z
	c = z + x
	if a == z:
		print('YES')
	elif b == x:
		print('YES')
	elif c == y:
		print('YES')
	else:
		print('NO')


T = int(input())
for i in range(T):
	(A, B, C) = map(int, input().split())
	D = [A, B, C]
	D.sort()
	if D[0] + D[1] == D[2]:
		print('YES')
	else:
		print('NO')


for i in range(int(input())):
	a = list(map(int, input().split()))
	a.sort()
	if a[2] == a[0] + a[1]:
		print('YES')
	else:
		print('NO')


def perfect_trio(A, B, C):
	if A == B + C or B == A + C or C == A + B:
		return 'YES'
	else:
		return 'NO'
N = int(input())
for i in range(N):
	(A, B, C) = map(int, input().split())
	print(perfect_trio(A, B, C))


T = int(input())
for i in range(T):
	lis = list(map(int, input().split()))
	if lis[0] == lis[1] + lis[2] or lis[1] == lis[2] + lis[0] or lis[2] == lis[0] + lis[1]:
		print('YES')
	else:
		print('NO')


n = int(input())
for _ in range(n):
	a = list(map(int, input().split()))
	if a[0] + a[1] == a[2] or a[0] + a[2] == a[1] or a[1] + a[2] == a[0]:
		print('YES')
	else:
		print('NO')


n = int(input())
for I in range(n):
	m = input().split()
	if int(m[0]) + int(m[1]) == int(m[2]) or int(m[1]) + int(m[2]) == int(m[0]) or int(m[0]) + int(m[2]) == int(m[1]):
		print('YES')
	else:
		print('NO')


n = int(input())
for i in range(n):
	lst = list(map(int, input().split()))[:3]
	if lst[0] + lst[1] == lst[2] or lst[2] + lst[1] == lst[0] or lst[0] + lst[2] == lst[1]:
		print('YES')
	else:
		print('NO')


t = int(input())
while t > 0:
	ages = list(map(int, input().split()))
	maxAge = max(ages)
	tempAge = maxAge
	for age in ages:
		if age != maxAge:
			tempAge -= age
	print('YES' if tempAge == 0 else 'NO')
	t -= 1