Problem:
 Score : 100 points    Problem Statement Two students of AtCoder Kindergarten are fighting over candy packs.  There are three candy packs, each of which contains a , b , and c candies, respectively.  Teacher Evi is trying to distribute the packs between the two students so that each student gets the same number of candies. Determine whether it is possible.  Note that Evi cannot take candies out of the packs, and the whole contents of each pack must be given to one of the students.      Constraints  1 ≦ a, b, c ≦ 100         Input The input is given from Standard Input in the following format:  a  b  c       Output If it is possible to distribute the packs so that each student gets the same number of candies, print Yes . Otherwise, print No .        Sample Input 1 10 30 20      Sample Output 1 Yes  Give the pack with 30 candies to one student, and give the two packs with 10 and 20 candies to the other. Then, each gets 30 candies.       Sample Input 2 30 30 100      Sample Output 2 No  In this case, the student who gets the pack with 100 candies always has more candies than the other.  Note that every pack must be given to one of them.       Sample Input 3 56 25 31      Sample Output 3 Yes

Solution (Python):
def resolve():
    a,b,c=map(int, input().split())
    if a==b+c or b==a+c or c==a+b:
        print('Yes')
    else:
        print('No')
resolve()

Solution (Python):
L = list(map(int,input().split()))
L.sort()
if L[0] + L[1] == L[2]:
    print('Yes')
else:
    print('No')

Solution (Python):
a,b,c=[int(i) for i in input().split()]
if (a+b)==c or (b+c)==a or (c+a)==b:
  print('Yes')
else:
  print('No')

Solution (Python):
a,b,c = map(int,input().split())

if a+b==c or b+c==a or a+c==b:
  print('Yes')
else:
  print('No')

Solution (Python):
a,b,c=sorted(map(int,input().split()))
print('Yes' if a+b==c else 'No')

Solution (Python):
a,b,c = map(int,input().split())

if max(a,b,c)==a+b+c-max(a,b,c):
  print('Yes')
else:
  print('No')

Solution (Python):

import sys
input = sys.stdin.readline









A = list(map(int,input().split()))

A.sort()
print("Yes" if A[0]+A[1]==A[2] else "No")

Solution (Python):
a, b, c = map(int, input().split())
if a+b == c or b+c == a or c+a == b:
    print('Yes')
else:
    print('No')

Solution (Python):
L = list(map(int, input().split()))

ans = 'Yes' if max(L) == (sum(L) - max(L)) else 'No'
print(ans)

Solution (Python):
abc = sorted(list(map(int, input().split())))
print("Yes" if abc[0] + abc[1] == abc[2] else "No")

Solution (Python):
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**7)
    from collections import Counter, deque
    
    from itertools import combinations, permutations, accumulate, groupby, product
    from bisect import bisect_left,bisect_right
    from heapq import heapify, heappop, heappush
    from math import floor, ceil
    

    
    

    a,b,c = map(int, input().split())
    if max(a,b,c) == a+b+c-max(a,b,c):
        print('Yes')
    else:
        print('No')

if __name__ == '__main__':
    main()

Solution (Python):
a = list(map(int,input().split()))
a.sort()
if a[0]+a[1]==a[2]:
  print('Yes')
else:
  print('No')

Solution (Python):
a, b, c = map(int, input().split())

if a + b == c or b + c == a or c + a == b:
    print("Yes")
else:
    print("No")

Solution (Python):
a,b,c = (map(int , input().split()))

if a+b==c or b+c==a or c+a==b:
  print("Yes")
else:
  print("No")

Solution (Python):

h = [int(x) for x in input().split()]
for i in range(3):
    if h[i] + h[(i+1)%3] == h[(i+2)%3]:
        print("Yes")
        exit()
print("No")

Solution (Python):
a,b,c = (map(int, input().split()))
s1 = a+b
s2 = b+c
s3 = c+a
if s1==c or s2==a or s3==b:
    print("Yes")
else:
    print("No")

Solution (Python):
a,b,c=map(int,input().split())
if (a+b)==c or (a+c)==b or (b+c)==a:
    print("Yes")
else:
    print("No")

Solution (Python):
a,b,c = map(int,input().split())

if max(a,b,c) == a+b+c-max(a,b,c):
    print('Yes')
else:
    print('No')

Solution (Python):
a,b,c=map(int, input().split())
if sum([a,b,c]) == 2 * max([a,b,c]):
  print('Yes')
else:
  print('No')

Solution (Python):
n = list(map(int,input().split()))

n.sort(reverse = True)

if n[0] == n[1]+n[2]:
    print("Yes")
else:
    print("No")

Solution (Python):
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")

Solution (Python):
def resolve():
	p = list(map(int, input().split()))
	m =max(p)
	s = 0
	for i in p:
		if i == m:
			continue
		s += i
	if m == s:
		print("Yes")
	else:
		print("No")
resolve()

Solution (Python):
a,b,c = map(int,input().split())

List =[a,b,c]
x = sorted(List)

if x[0] + x[1] == x[2]:
    print("Yes")
else :
    print("No")

Solution (Python):
a,b,c=map(int,input().split())
if int((a+b+c)/a)==2 or int((a+b+c))/b==2 or int((a+b+c))/c==2:
    print("Yes")
else:
    print("No")

Solution (Python):
a,b,c=sorted(map(int,input().split()))
if a+b==c:
    print("Yes")
else:
     print("No")

Solution (Python):
a = list(map(int, input().split()))
if max(a) == sum(a) - max(a):
    print("Yes")
else:
    print("No")

Solution (Python):
C = list(map(int, input().split()))
 
C.sort()
 
if C[2] == C[1] + C[0]:
    print('Yes')
else:
    print('No')

Solution (Python):
a, b, c = map(int, input().split())
L = sorted([a, b, c])
print("Yes" if L[0] + L[1] == L[2] else "No")

Solution (Python):
a, b, c = map(int, input().split())

add = a + b + c
big = max(a, b, c)

if add == big * 2:
    print("Yes")

else:
    print("No")

Solution (Python):
a = list(map(int, input().split()))
a.sort()
if a[0] + a[1] == a[2]:
    print('Yes')
else:
    print('No')

Solution (Python):
a, b, c = map(int, input().split())
if a+b==c or a+c==b or b+c==a:
  print('Yes')
else:
  print('No')

Solution (Python):
a,b,c=map(int,input().split())
if a+b==c or a+c==b or b+c==a:
    print("Yes")
else:
    print("No")

Solution (Python):
a,b,c=map(int,input().split())
if(a==b+c or b==a+c or c==a+b):
  print("Yes")
else:
      print("No")

Solution (Python):
a, b, c = map(int, input().split())

if a + b == c or a + c == b or b + c == a:
  print('Yes')
else:
  print('No')

Solution (Python):
a, b, c = map(int, input().split())
if a+b == c or b+c == a or c+a == b:
    print("Yes")
else:
    print("No")

Solution (Python):
import sys

stdin = sys.stdin
inf = 1 << 60
mod = 1000000007

ni      = lambda: int(ns())
nin     = lambda y: [ni() for _ in range(y)]
na      = lambda: list(map(int, stdin.readline().split()))
nan     = lambda y: [na() for _ in range(y)]
nf      = lambda: float(ns())
nfn     = lambda y: [nf() for _ in range(y)]
nfa     = lambda: list(map(float, stdin.readline().split()))
nfan    = lambda y: [nfa() for _ in range(y)]
ns      = lambda: stdin.readline().rstrip()
nsn     = lambda y: [ns() for _ in range(y)]
ncl     = lambda y: [list(ns()) for _ in range(y)]
nas     = lambda: stdin.readline().split()

a, b, c = na()

flag = False
if a + b == c or a + c == b or b + c == a:
    flag = True

print("Yes" if flag else "No")

Solution (Python):
a,b,c = map(int,input().split())
if a+b == c  or b+c == a or c+a == b:
  print('Yes')
else:
  print('No')

Solution (Python):
A=list(map(int,input().split()))

max_des = max(A)

A.remove(max_des)

if sum(A)==max_des:
    print('Yes')
else:
    print('No')

Solution (Python):
l = sorted([int(i) for i in input().split()])
if l[2] == l[1] + l[0]:
  print("Yes")
else:
  print("No")

Solution (Python):
a,b,c=map(int,input().split())

if a+b==c or a+c==b or c+b==a:
    print('Yes')
else:
    print('No')

Solution (Python):
a, b, c = map(int, input().split())

h = (a + b + c) // 2
A = (a + b + c) % 2

if A != 0:
  print("No")
  exit()

if h == a or h == b or h == c:
  print("Yes")
else:
  print("No")

Solution (Python):
arr = list(map(int, input().split()))
arr2 = sorted(arr)
if arr2[2] == arr2[0]+arr2[1]:
    print("Yes")
else:
    print("No")

Solution (Python):
a, b, c = map(int, input().split())
x=max(a,b,c)
if x == a+b+c-x:
    print("Yes")
else:
    print("No")

Solution (Python):
icase=47    
if icase==47:
    a,b,c=map(int,input().split())
    if a+b==c or a+c==b or b+c==a:
        print("Yes")
    else:
        print("No")

Solution (Python):
a,b,c = map(int,input().split())
if a + b == c or b + c  == a or c + a == b:
    print("Yes")
else:
    print("No")

Solution (Python):
a, b, c = sorted(map(int, input().split()))
print("Yes" if a+b == c else "No")

Solution (Python):
a,b,c=map(int,input().split())
print('Yes' if a+b==c or b+c==a or a+c==b else 'No')

Solution (Python):
def main():
    a, b, c = map(int, input().split())

    flag = False

    if a == b + c :
        flag = True
    if b == a + c :
        flag = True
    if c == b + a :
        flag = True

    if flag == True:
        print("Yes")
    else:
        print("No")
main()

Solution (Python):
a = list(map(int, input().split()))

a.sort()

if a[0]+a[1] == a[2]:
  print('Yes')
else:
  print('No')

Solution (Python):

candy_packs = sorted(map(int, input().split()))
if candy_packs[2] == (candy_packs[0] + candy_packs[1]):
    print("Yes")
else:
    print("No")

Solution (Python):
a, b, c = map(int, input().split())

l = [a, b, c]

l.sort()

if l[0] + l[1] == l[2]:
    print('Yes')
else:
    print('No')

Solution (Python):
a,b,c=sorted(map(int,input().split()))
print("Yes" if a+b==c else "No")

Solution (Python):
a,b,c=map(int,input().split())
print("Yes" if a+b==c or b+c==a or c+a==b else "No")

Solution (Python):
lst = list(map(int, input().split()))
lst = sorted(lst)
print('Yes' if lst[0] + lst[1] == lst[2] else 'No')

Solution (Python):
a,b,c=map(int,input().split())

if a+b==c or a+c==b or b+c==a:
    print("Yes")
else:
    print("No")

Solution (Python):
a,b,c=map(int,input().split())
if a+b==c or b+c==a or c+a==b:
	print("Yes")
else:
    print("No")

Solution (Python):
A, B, C = map(int, input().split())

AB = A+B
BC = B+C
CA = C+A

if AB==C or BC==A or CA==B:
    print("Yes")
else:
    print("No")

Solution (Python):
li = sorted(list(map(int,input().split())))

a = li[0]
b = li[1]
c = li[2]

if a + b == c:
  print('Yes')

else:
  print('No')

Solution (Python):
li = list(map(int, input().split()))
li = sorted(li)
print("Yes" if li[0]+li[1]==li[2] else "No")

Solution (Python):
C = list(map(int, input().split()))

C.sort()

if C[2] == C[1] + C[0]:
  print('Yes')
else:
  print('No')

Solution (Python):
a, b, c = map(int, input().split())

if a + b == c or a + c == b or b + c == a:
    print('Yes')
else :
    print('No')

Solution (Python):
a, b, c = map(int, input().split())
C = a + b
A = b + c
B = c + a

if a == A or b == B or C == c: print("Yes")
else: print("No")

Solution (Python):
l = sorted(map(int, input().split()))
print(["No","Yes"][l[2]*2==sum(l)])

Solution (Python):
a, b, c = map(int, input().split())
X = max([a, b, c])
if (X == a+b+c-X):
    print('Yes')
else:
    print('No')

Solution (Python):
import sys

input = sys.stdin.readline


def main():
    a, b, c = map(int, input().split())
    ans = "No"
    if a == b + c:
        ans = "Yes"
    if b == c + a:
        ans = "Yes"
    if c == a + b:
        ans = "Yes"
    print(ans)


if __name__ == "__main__":
    main()

Solution (Python):
a,b,c = map(int,input().split())
 
if a+b==c or a+c==b or b+c==a:
    print("Yes")
else:
    print("No")

Solution (Python):
a,b,c = map(int, input().split())
print("Yes" if a+b == c or a+c == b or b+c == a else "No")

Solution (Python):
n = list(map(int,input().split()))
n.sort()
if n[0] + n[1] == n[2]:
    print("Yes")
else:
    print("No")

Solution (Python):
a = sorted(list(map(int, input().split())))
if a[0] + a[1] == a[2]:
  print('Yes')
else:
  print('No')

Solution (Python):
a=list(map(int,input().split()))
print("Yes" if max(a)*2==sum(a) else "No")

Solution (Python):
a,b,c = map(int,input().split())
if a+b == c or a+c == b or b+c ==a:
  print("Yes")
else:
  print("No")

Solution (Python):
a = sorted(list(map(int,input().split())))
print('Yes' if a[0]+a[1]==a[2] else 'No')

Solution (Python):

lst = list(map(int, input().split()))
lst.sort(reverse=True)
if lst[0] == lst[1] + lst[2]:
    print('Yes')
else:
    print('No')

Solution (Python):
a,b,c=sorted(list(map(int,input().split())))
if a+b==c:print("Yes")
else:print("No")

Solution (Python):
a,b,c=map(int,input().split())
A=[a,b,c]
B=sorted(A)
if B[2]==B[0]+B[1]:
  print("Yes")
else:
  print("No")

Solution (Python):
a=[int(i) for i in input().split()]

a.sort()

if a[2]==a[1]+a[0]:
    print("Yes")
else:
    print("No")

Solution (Python):
a,b,c = map(int,input().split())
n = [a,b,c]
abc = (a+b+c)/2
if abc in n:
  print("Yes")
else:
  print("No")

Solution (Python):
a,b,c = map(int,input().split())
if (a+b) == c or (b+c) == a or (c+a) == b:
  print("Yes")
else:
  print("No")

Solution (Python):
li = list(map(int, input().split()))
if li[0]+li[1] == li[2] or li[1]+li[2] == li[0] or li[2]+li[0] == li[1]:
    print('Yes')
else:
    print('No')

Solution (Python):
a,b,c = map(int,input().split())

l = [a,b,c]

abc = sum(l)/2

if abc in l:
  print('Yes')
else:
  print('No')

Solution (Python):
a,b,c=map(int,input().split())
if (a+b)==c or (b+c)==a or (a+c)==b:
    print("Yes")
else:
    print("No")

Solution (Python):
a,b,c=map(int,input().split())
d=max(a,b,c)
if d==a:
  if d==b+c:
    print('Yes')
  else:
    print('No')
elif d==b:
  if d==a+c:
    print('Yes')
  else:
    print('No')
elif d==c:
  if d==a+b:
    print('Yes')
  else :
    print('No')

Solution (Python):
a,b,c = map(int, input().split())
tmp = a + b + c

if (tmp - a == tmp/2 or tmp - b == tmp/2 or tmp - c == tmp/2):
    print('Yes')
else:
    print('No')

Solution (Python):
a, b, c= map(int, input().split())
hantei=0
if a+b==c:
    hantei=1
if a+c==b:
    hantei=1
if b+c==a:
    hantei=1
if hantei==1:
    print('Yes')
else:
    print('No')

Solution (Python):
a,b,c=map(int,input().split())
if(a+b==c or a+c==b or b+c==a):
	print('Yes')
else:
	print('No')

Solution (Python):
a, b, c = map(int, input().split())
if a + b == c or a+c==b or b+c==a:
    print("Yes")
else:
    print("No")

Solution (Python):
a, b, c = map(int, input().split())
if a + b == c or a + c == b or b + c == a:
    print("Yes")
else:
    print("No")

Solution (Python):
a=list(map(int,input().split()))

print("Yes"if max(a)==sorted(a)[-2]+min(a) else"No")

Solution (Python):
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')

Solution (Python):
a=list(map(int,input().split()))

a.sort(reverse=True)

if a[0]==a[1]+a[2]:
  print('Yes')
else:
  print('No')

Solution (Python):
a,b,c = map(int, input().split())
if (a+b)==c:
  print("Yes")
elif (a+c)==b:
  print("Yes")
elif (b+c)==a:
  print("Yes")
else:
  print("No")

Solution (Python):
a, b, c = map(int, input().split())

if a + b + c == max(a, b, c) * 2:
    print('Yes')
else:
    print('No')

Solution (Python):
a,b,c=map(int,input().split())
if a == b + c or b == c + a or c == b + a:
  print("Yes")
else:
  print("No")

Solution (Python):
a = [int(i) for i in input().split()]
if max(a) == (sum(a)-max(a)):
    print('Yes')
else:
    print('No')

Solution (Python):
l = list(map(int, input().split()))
m = max(l)
l.remove(max(l))
s = sum(l)
if m == s:
    print('Yes')
else:
    print('No')

Solution (Python):
a,b,c = map(int,input().split())

if a+b == c or abs(a-b) == c:
  print('Yes')
else:
  print('No')

Solution (Python):
a, b, c = map(int, input().split())
if a+b==c or a+c==b or b+c==a:
  print('Yes')
else:
  print('No')

Solution (Python):
a,b,c=map(int,input().split())
if a==b+c or b==c+a or c==a+b: print("Yes")
else: print("No")

Solution (Python):
a, b, c = map(int, input().split(' '))
if a==b+c or b==a+c or c==a+b:
    print('Yes')
else:
    print('No')

Solution (Python):
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')

Solution (Python):
X = [int(x) for x in input().split()]
Y = sorted(X)
if Y[0] + Y[1] == Y[2]:
    print('Yes')
else:
    print('No')

Solution (Python):
a, b, c = map(int, input().split())

if max(a,b,c) * 2 == sum((a,b,c)):
    print('Yes')
else:
    print('No')

Solution (Python):
a, b, c = map(int, raw_input() .split())
if a + b == c or a == b +c or a + c == b:
    print "Yes"
else:
    print "No"

Solution (Python):
x = list(map(int,input().split()))
x.sort()
if x[2]==x[1]+x[0]:
    print("Yes")
else:
    print("No")

Solution (Python):
a,b,c = map(int,input().split())
if a == b+c or b == a+c or c == a+b:
    print("Yes")
else:
    print("No")

Solution (Python):
a = list(map(int,input().split()))
a.sort()
print('Yes' if a[0]+a[1] == a[2] else 'No')

Solution (Python):
can = list(map(int,input().split()))

can.sort()

if can[0] + can[1] == can[2]:
    print("Yes")
else:
    print("No")

Solution (Python):
A, B, C = list(map(int,input().split()))
if A + B == C or B + C == A or C + A == B:
  print('Yes')
else:
  print('No')

Solution (Python):
a,b,c = [int(i) for i in input().split()]
if a == b+c or b == a+c or c == a+b:
    print("Yes")
else:
    print("No")

Solution (Python):
A = list(map(int,input().split()))

def main():
  L = sorted(A,reverse = True)
  print("Yes" if (L[0] == L[1] + L[2]) else "No")

if __name__ == '__main__':
  main()

Solution (Python):
a,b,c =sorted(map(int, input().split()))
print("Yes"if c==b+a else "No")

Solution (Python):
a,b,c = map(int,input().split())
if a + b == c or a + c == b or c + b == a:
    print('Yes')
else:
    print('No')

Solution (Python):
a,b,c = map(int,input().split())

if a == b + c:
	answer = "Yes"
elif b == a + c:
	answer = "Yes"
elif c == a + b:
	answer = "Yes"
else:
	answer = "No"

print(answer)

Solution (Python):
a,b,c = map(int,input().split())
List = [a,b,c]
List = sorted(List)
print("Yes" if List[0]+List[1] == List[2] else "No")

Solution (Python):
A = list(map(int, input().split()))
u = max(A)
l = min(A)
s = sum(A)
print('Yes' if u - l == s - (u + l) else 'No')

Solution (Python):
abc=list(map(int,input().split()))

if max(abc)==(sum(abc)-max(abc)):
    print("Yes")
else:
    print("No")

Solution (Python):
import sys

*c, = map(int, sys.stdin.readline().split())

def main():
    c.sort()
    ans = 'Yes' if c[0] + c[1] == c[2] else 'No'
    print(ans)

if __name__ ==  '__main__':
    main()

Solution (Python):
a,b,c=map(int,input().split())
print('Yes' if ((a==(b+c)) or (b==(a+c)) or (c==(a+b))) else 'No')

Solution (Python):

nums = [int(s) for s in input().split()]
nums.sort()

print("Yes" if nums[0] + nums[1] == nums[2] else "No")

Solution (Python):
a, b, c = map(int, input().split())

if a+b == c or a+c == b or b+c==a:
    print("Yes")
else:
    print("No")

Solution (Python):
a=list(sorted(map(int,input().split()))[::-1])
print("Yes" if a[0]==a[1]+a[2] else "No")

Solution (Python):
a, b, c = map(int,input().split())
x = (a+b+c) - max(a,b,c)
y = max(a,b,c)
if x == y:
    print('Yes')
else:
    print('No')

Solution (Python):
a,b,c=map(int,raw_input().split())
if a+b==c or b+c==a or c+a==b:
  print "Yes"
else:
  print "No"

Solution (Python):
A,B,C=sorted(map(int,input().split()));print('YNeos'[A+B!=C::2])

Solution (Python):

a,b,c, = map(int,input().split())

if a+b == c:
    print("Yes")
elif a + c == b:
    print("Yes")
elif b + c == a:
    print("Yes")
else:
    print("No")

Solution (Python):
import sys
import copy
import math
import bisect
import pprint
import bisect
from functools import reduce
from copy import deepcopy
from collections import deque

if __name__ == '__main__':
    a = [int(i) for i in input().split()]
    a.sort()

    if a[0] +a[1] == a[2]:
        print("Yes")
    else:
        print("No")

Solution (Python):

from sys import stdin
from operator import itemgetter
import math


a = list(map(int,[int(x) for x in stdin.readline().rstrip().split()]))

if a[0]+a[1] == a[2] or a[1]+a[2] == a[0] or a[2]+a[0] == a[1]:
    print("Yes")
else:
    print("No")

Solution (Python):
A = list(map(int, input().split()))
p = max(A)
k = sum(A)
if k == p*2:
    print("Yes")
else:
    print("No")

Solution (Python):
a,b,c=map(int,input().split())
if a==b+c:
    print('Yes')
    exit()
elif b==a+c:
    print('Yes')
    exit()
elif c==a+b:
    print('Yes')
    exit()
print('No')

Solution (Python):
a,b,c = map(int,input().split())

sm = a + b + c
if sm - max(a,b,c) == sm // 2:
  print('Yes')


else:print('No')

Solution (Python):
import math

a,b,c=map(int,input().split())
l=[a,b,c]
l.sort()


print("Yes" if l[0]+l[1]==l[2] else "No")

Solution (Python):
c = list(map(int, input().split()))
c.sort()
if c[0] + c[1] == c[2]:
  print("Yes")
else:
  print("No")

Solution (Python):
x,y,z=map(int,input().split())
if x+y==z or y+z==x or z+x==y:
    print('Yes')
else:
    print('No')

Solution (Python):
L=list(map(int,input().split()))
M=sorted(L)
if M[0]+M[1]==M[-1]:
	print("Yes")
else:
	print("No")

Solution (Python):
import sys

def solve():
    input = sys.stdin.readline
    C = [int(a) for a in input().split()]
    C.sort()
    if C[0] + C[1] == C[2]: print("Yes")
    else: print("No")
    

    return 0

if __name__ == "__main__":
    solve()

Solution (Python):
def main():
    a, b, c = (int(i) for i in input().split())
    if a+b == c or b+c == a or b == c+a:
        print("Yes")
    else:
        print("No")


if __name__ == '__main__':
    main()

Solution (Python):
A = list(map(int, input().split()))
A.sort()

print('Yes'if A[0] + A[1] == A[2] else 'No')

Solution (Python):
A = list(map(int, input().split()))
A.sort()

print('Yes'if A[0] + A[1] == A[2] else 'No')

Solution (Python):
a,b,c = map(int,input().split())
if max(a,b,c) * 2 == a + b + c:
    print("Yes")
else:
    print("No")

Solution (Python):
candies = list(map(int, input().split()))
candies.sort()
if candies[2] == candies[0] + candies[1]:
    print("Yes")
else:
    print("No")

Solution (Python):
a = list(map(int, input().split()))

print("Yes" if max(a) == sum(a) - max(a) else "No")

Solution (Python):
l = list(map(int, input().split()))
s = sum(l)
for i in range(3):
    if l[i] == s-l[i]:
        print('Yes')
        exit()
else:
    print('No')

Solution (Python):
a, b, c = map(int, input().split())
print('Yes' if a+b == c or b+c == a or a+c == b else 'No')

Solution (Python):



a, b, c = map(int, input().split())


is_ok = False


if a+b==c:
    is_ok = True
elif a+c==b:
    is_ok = True
elif b+c==a:
    is_ok = True


if is_ok:
    print("Yes")
else:
    print("No")

Solution (Python):

GBN_DEBUG = False
def dprn(s, i):
    if GBN_DEBUG: print(", " + s + " = " + str(i), end = "")
def dprns(s):
    if GBN_DEBUG: print(", " + s, end = "")
def dprni(i):
    if GBN_DEBUG: print(i, end=" ")
def endl(): 
    if GBN_DEBUG: print('')
def puts(s): print(s)






a, b, c = map(int, input().split())





if (a + b == c) or (b + c == a) or (c + a == b):
    print('Yes')
else:
    print('No')

Solution (Python):
*a,=map(int, input().split())
a.sort()
if a[0]+a[1]==a[2]:
    print('Yes')
else:
    print('No')

Solution (Python):
a, b, c = map(int, input().split())

if a == b+c or b == a+c or c == a+b:
    print('Yes')
else:
    print('No')

Solution (Python):
a,b,c = map(int,input().split())
u = [a,b,c]
u.sort()
if u[0] + u[1] == u[2]:
    print("Yes")
else:
    print("No")

Solution (Python):
a,b,c = map(int, input().split())
if a+b == c or b+c == a or c+a == b:
    print("Yes")
else:
    print("No")

Solution (Python):

a, b, c = map(int,input().split())

tmp = [a, b, c]
tmp.sort()
if tmp[0] + tmp[1] == tmp[2]:
    print("Yes")
else:
    print("No")

Solution (Python):
a,b,c = map(int,input().split())
if a+b==c or a+c==b or b+c==a:
    print('Yes')
else:
    print('No')

Solution (Python):
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, acos, atan, asin
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
def input(): return sys.stdin.readline().strip()
def STR(): return input()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
sys.setrecursionlimit(10 ** 9)
inf = sys.maxsize
mod = 10 ** 9 + 7

a = LIST()
a.sort()
if a[0] + a[1] == a[2]:
    print('Yes')
else:
    print('No')

Solution (Python):
a,b,c=map(int,input().split())
if a+b==c or a+c==b or b+c==a:
  print("Yes")
else:
  print("No")

Solution (Python):
a,b,c = [int(x) for x in input().split()]

if a+b == c or a+c == b or b+c == a:
    print("Yes")
else:
    print("No")

Solution (Python):
a, b, c = map(int, input().split())

if a+b == c or a+c == b or b+c == a:
    print('Yes')
else:
    print('No')

Solution (Python):
a,b,c = list(map(int,input().split()))
if a==b+c or b==a+c or c==a+b :print('Yes')
else:print('No')

Solution (Python):
a,b,c=map(int,input().split())
if a==b+c or b==c+a or c==a+b:
  print("Yes")
else:
  print("No")

Solution (Python):
S = list(map(int, input().split()))
S = sorted(S)
print("Yes" if S[0]+S[1] == S[2] else "No")

Solution (Python):
a, b, c = map(int,input().split())
sum = a+b+c
flag = False
if sum/2 == a + b:
  flag = True
if sum/2 == b + c:
  flag = True
if sum/2 == c + a:
  flag = True

if flag == True:
  print("Yes")
else:
  print("No")

Solution (Python):
a, b, c = map(int, input().split())
candies = [a, b, c]
candies.sort()

if candies[0] + candies[1] == candies[2]:
  print("Yes")
else:
  print("No")

Solution (Python):
a, b, c = map(int, input().split())
if a == b+c or b == c+a or c == a+b:
    print("Yes")
else:
    print("No")

Solution (Python):
a,b,c=map(int, input().split())  


if a+b==c or b+c==a or c+a==b:
    print('Yes')
else:
    print('No')

Solution (Python):
a=sorted(list(map(int,input().split())))
if a[0]+a[1]==a[2]:
    print("Yes")
else:
    print("No")

Solution (Python):
a = list(map(int,input().split()))

ok = False
for i in range(len(a)):
    if a[i] == sum(a) - a[i]:
        ok = True
if ok:
    print("Yes")
else:
    print("No")

Solution (Python):
a,b,c = list(map(int, input().split()))

if a + b == c or a == b + c or a + c == b:
    print('Yes')
else:
    print('No')

Solution (Python):
a=list(map(int,input().split()))

print("Yes"if max(a)==sorted(a)[-2]+min(a) else"No")

Solution (Python):
a,b,c=sorted(map(int,input().split()))
if a+b==c:
  print('Yes')
else:
  print('No')

Solution (Python):
a,b,c, = map(int,input().split())

if a+b == c or b+c == a or c+a == b:
    print("Yes")
else:
    print("No")

Solution (Python):
a,b,c = map(int,input().split())

if a+b==c or a+c==b or b+c==a:
    print("Yes")
else:
    print("No")

Solution (Python):
a,b,c=map(int,input().split())

if (a+b+c)-max(a,b,c)==max(a,b,c):
  print("Yes")
else:
  print("No")

Solution (Python):
a, b, c = sorted(map(int, input().split()))
print("Yes" if a+b == c else "No")

Solution (Python):
a, b, c = map(int,input().split())

if a == b + c:
  print ("Yes")
elif b == a + c:
  print ("Yes")
elif c == a + b:
  print ("Yes")
else:
  print ("No")

Solution (Python):
a,b,c=map(int,input().split())
if a+b==c or b+c==a or c+a==b:
    print("Yes")
else:
    print("No")

Solution (Python):
nums = sorted(list(map(int, input().split())))
result = 'Yes' if (nums[0] + nums[1] == nums[2]) else 'No'
print(result)

Solution (Python):
a, b, c = map(int, input().split())
if a+b==c or a+c==b or b+c==a:
  print('Yes')
  exit()
print('No')

Solution (Python):
import sys
input = sys.stdin.readline

def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))

def main():
    mod=10**9+7
    a,b,c=MI()
    if a+b+c==2*max(a,b,c):
        print("Yes")
    else:
        print("No")

main()

Solution (Python):
in_list = list(map(int,input().split()))

if in_list[0] == in_list[1] + in_list[2] or in_list[1] == in_list[2] + in_list[0] or in_list[2] == in_list[1] + in_list[0]:
    print ('Yes')
else:
    print ('No')

Solution (Python):
c = map(int, input().split())
c = sorted(c)
ans = 'Yes' if c[0] + c[1] == c[2] else 'No'
print(ans)

Solution (Python):
c = map(int, input().split())
c = sorted(c)
ans = 'Yes' if c[0] + c[1] == c[2] else 'No'
print(ans)

Solution (Python):
A = list(map(int, input().split()))

A.sort()

if A[0] + A[1] == A[2]:
    print("Yes")
else:
    print("No")

Solution (Python):

a,b,c = map(int,input().split())
if a + b ==c or a +c==b or b+c ==a:
    print('Yes')
else:
    print('No')

Solution (Python):
a,b,c=map(int,input().split())
print('Yes' if a+b==c or b+c==a or c+a==b else 'No')

Solution (Python):
a = list(map(int, input().split()))
if sum(a) == max(a) * 2:
    print('Yes')
else: print('No')

Solution (Python):
a = sorted([int(x) for x  in input().split()])
print('Yes' if a[0] + a[1] == a[2] else 'No')

Solution (Python):
lst = list(map(int, input().split()))

ans = 'No'

mi = lst.index(max(lst))
mx = lst.pop(mi)

if mx == sum(lst):
    ans = 'Yes'
    
print(ans)

Solution (Python):

a,b,c=map(int,input().split())
if a+b==c or a+c==b or b+c==a:
    print("Yes")
else:
    print("No")

Solution (Python):
a =  list(map(int, input().split()))
if sum(a)-max(a) == max(a):
  print("Yes")
else:
  print("No")

Solution (Python):

p=list(map(int,input().split()))
if max(p)==(sum(p)-max(p)):
    print("Yes")
else:
    print("No")

Solution (Python):
candy_list = [int(i) for i in input().split()]

max_candy = candy_list.pop(candy_list.index(max(candy_list)))

if max_candy == sum(candy_list):
  print("Yes")
else:
  print("No")

Solution (Python):
A = list(map(int,input().split()))

As = sorted(A)
if As[2] == As[1]+As[0]:
    print("Yes")
else:
    print("No")

Solution (Python):
a,b,c=map(int,input().split())
if a+b==c or a+c==b or b+c==a:
  print("Yes")
else:
  print("No")

Solution (Python):
a,b,c=map(int,input().split())
t=a+b+c
k=0 if a+b==c or a+c==b or b+c==a else 1
print(['Yes','No'][k])

Solution (Python):
a, b, c = map(int,input().split())
if a+b==c or b+c==a or c+a==b:
    print("Yes")
else:
    print("No")

Solution (Python):
l = list(map(int, input().split()))
p = max(l)
s = min(l)
wa =sum(l)
m = wa - p - s
if m + s == p:
    print("Yes")
else:
    print("No")

Solution (Python):
A = list(map(int, input().split()))
if sum(A)/2 in A:
  print('Yes')
else:
  print('No')

Solution (Python):
a, b, c = map(int, input().split())
if a + b == c or a + c == b or b + c == a: print("Yes")
else: print("No")

Solution (Python):
List=sorted(map(int,input().split()))[::-1]
print("Yes" if List[0]==List[1]+List[2] else "No")

Solution (Python):
import sys
readline = sys.stdin.buffer.readline

lst1 = list(map(int,readline().split()))

for i in range(3):
    if lst1[i] == sum(lst1)-lst1[i]:
        print("Yes")
        exit()
print("No")

Solution (Python):
a,b,c=map(int,input().split())
if a+b==c or a+c==b or b+c==a:
    print("Yes")
else:
    print("No")

Solution (Python):
a, b, c = map(int, input().split())
if a + b == c or b + c == a or a + c == b:
    print('Yes')
else:
    print('No')

Solution (Python):



l = list(map(int,input().split()))

l.sort()

if l[2] == l[0] + l[1]:
    print('Yes')
else:
    print('No')

Solution (Python):
a,b,c = map(int,input().split())
if (a+b == c) or (a+c == b) or (b+c == a):
  print("Yes")
else:
  print("No")

Solution (Python):
l= sorted(list(map(int,input().split())))
if l[0] + l[1] == l[2]:
  print('Yes')
else:
  print('No')

Solution (Python):
x=list(map(int, input().split()))
x.sort()
if x[0]+x[1]==x[2]:
	print('Yes')
else:
	print('No')

Solution (Python):

a,b,c=list(map(int,input().split()))

m=max([a,b,c])
r=sum([a,b,c])-m
if m==r:
    print("Yes")
else:
    print("No")