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):
a,b,c=map(int,input().split())
d=max(a,b,c)
if d*2==a+b+c:
    print("Yes")
else:
    print("No")

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

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

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

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

Solution (Python):
a,b,c=map(int,input().split())
m=max(a,b,c)
if m==a+b+c-m:
     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 b+c == a or c+a == b:
  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,b,c=map(int,input().split())
m=max(a,b,c)
def fun():
     a=b+c
     c=a-b
     if a==b:
          c=a
          a=b-s
if m==a+b+c-m:
     print("Yes")
else:
     print('No')

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

Solution (Python):
abc = list(map(int, input().split()))
ma = max(abc)
abc.remove(ma)
if sum(abc) == ma:
    ans = "Yes"
else:
    ans = "No"
print(ans)

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

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

Solution (Python):
""" AtCoder """

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

abc.sort()

if abc[0] + abc[1] == abc[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 = sorted(list(map(int, input().split())), reverse=True)
print("Yes"if a[0]-a[1]-a[2]==0 else "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 = [int(i) for i in 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())))
print('Yes' if(l[2]==l[0]+l[1]) else 'No')

Solution (Python):
a, b, c = map(lambda x : int(x), 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('YNeos'[(a[0]+a[1]!=a[2])::2])

Solution (Python):
abc=list(map(int,input().split()))
print('Yes') if max(abc)==sum(abc)-max(abc) 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):


import sys

INF = float('inf')
MOD = 10 ** 9 + 7

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def II(): return int(sys.stdin.readline())
def SI(): return input()


A = LI()
A.sort()
print('Yes' if sum(A[:-1]) - A[-1] == 0 else 'No')

Solution (Python):
A = [int(i) for i in input().split()]
print('Yes' if sum(A) == max(A) * 2 else '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):


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

abc.sort()

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

Solution (Python):
a,b,c = map(int,input().split())
def main(a,b,c):
    if (a+b+c)%2==1:return 'No'
    x=(a+b+c)/2
    if x==a:return 'Yes'
    elif x==b:return 'Yes'
    elif x==c:return 'Yes'
    else:return 'No'

print(main(a,b,c))

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

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

data.sort()

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

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

if ame[0]+ame[1] == ame[2]:
    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()))
l = sorted(a)
if l[0] + l[1] == l[2]:
    print('Yes')
else:
    print('No')

Solution (Python):
def execute(a, b, c):
    s = sorted([a, b, c])
    return 'YNeos'[s[2] != (s[0] + s[1])::2]


if __name__ == '__main__':
    a, b, c = map(int, input().split())
    print(execute(a, b, c))

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 = list(map(int, input().split()))
l.sort()

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

Solution (Python):
a=list(map(int,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())
print("No"if a+b!=c and b+c!=a and a+c!=b else"Yes")

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

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

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

Solution (Python):
l = sorted(list(map(int,input().split())))
if l[0] + l[1] == l[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):
li = list(map(int, input().split()))
li.sort()
if li[0] + li[1] == li[2]:
	print('Yes')
else:
	print('No')

Solution (Python):
l=sorted(list(map(int,input().split())))
print("Yes" if l[0]+l[1]==l[2] else "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,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):
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):
n = [int(i) for i in input().split()]
print('Yes' if max(n) * 2 == sum(n) else '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):
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):
a = list(map(int,input().split()))
a.sort()

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

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

if sum(li_input[0:2]) == li_input[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):
l= list(map(int, input().split()))
l.sort()
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 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=list(map(int,input().split()))
a.sort()
if a[0]+a[1]==a[2]:
    print("Yes")
else:
    print("No")

Solution (Python):



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

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


if __name__ == '__main__':
    main()

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

Solution (Python):
a, b, c = (int(x) for x in 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())
print("Yes" if a+b==c or b+c==a or c+a==b 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 = list(map(int,input().split()))
print(((a==b+c)or(b==a+c)or(c==a+b))*('Yes') or ((a!=b+c)and(b!=a+c)and(c!=a+b))*('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(['No','Yes'][a+b==c])

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):
def main():
    aa = sorted(map(int, input().split()))
    if aa[0] + aa[1] == aa[2]:
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    main()

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):


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

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

    print('No')
    return


if __name__ == '__main__':
    main()

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):



def main():
    """Function."""
    a, b, c = map(int, input().split())

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


if __name__ == "__main__":
    main()

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

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

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

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

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

Solution (Python):
from statistics import mean, median,variance,stdev
import sys
import math

x = input().split()

a = []
for i in range(len(x)):
   a.append(int(x[i]))
if a[0]+a[1]==a[2] or a[1]+a[2]==a[0] or a[0]+a[2]==a[1]: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 a+c==b or b+c==a:
    print("Yes")
else:
    print("No")

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

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

Solution (Python):

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

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

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

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

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

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

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

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

Solution (Python):
a, b, c = list(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()))
a.sort()
if a[0] + a[1] == a[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 = [int(x) for x in input().split()]
print('Yes' if a + b == c or a == b + c or a + c == b else 'No')

Solution (Python):
a,b,c = map(int, input().split())
if a+b==c or a+c==b or 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, raw_input().split())
print "Yes" if (a + b + c) % 2 == 0 and (a + b + c) // 2 in [a, b, c] else "No"

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

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

Solution (Python):
a=input().strip().split(" ")

b=[int(i) for i in a]

b.sort()

if(b[2]==(b[0]+b[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):
b = sorted(list(map(int,input().split())))
print('Yes' if b[0]+b[1] == b[2] else 'No')

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

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

Solution (Python):
s = list(map(int, input().split()))
s_max = max(s)
s.remove(s_max)
if s_max == (s[0] + s[1]):
  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())
s = [a,b,c]
t = sorted(s)
if t[0] + t[1] == t[2]:
    print("Yes")
else:
    print("No")

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

Solution (Python):
L = [int(i) for i in input().split()]
L.sort()
if L[2] == L[1] + L[0]:
  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 print("No")

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

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,=map(int,input().split());print('YNeos'[sum(a)/2!=max(a)::2])

Solution (Python):
*a,=map(int,input().split());print('YNeos'[sum(a)/2!=max(a)::2])

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())
a=int(a)
b=int(b)
c=int(c)
avarage=(a+b+c)/2
if a!=avarage and b!=avarage and c!=avarage:
    print("No")
else:
    print("Yes")

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):
nums = list(map(int, input().split()))
if nums[0] < nums[1] and nums[0]+nums[2] == nums[1]:
	print('Yes')
elif nums[0] < nums[2] and nums[0]+nums[1] == nums[2]:
	print('Yes')
elif nums[1] < nums[0] and nums[2]+nums[1] == nums[0]:
	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):
def main():
    a = list(map(int, input().split()))
    a.sort()
    print("Yes" if a[0] + a[1] == a[2] else "No")


if __name__ == "__main__":
    main()

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

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()))

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

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,=map(int,input().split())
a.sort()
x,y,z=a[0],a[1],a[2]
if (x+y)==z:
	print('Yes')
else:
	print('No')

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

Solution (Python):
a=list(map(int,input().split()))
a.sort()
if a[2]==a[0]+a[1]:
    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,b,c = map(int,input().split())
candies =[a,b,c]
print('Yes' if max(candies) == sum(candies)-max(candies) else 'No')

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

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

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

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(["No", "Yes"][a + b == c or a + c == b or b + c == a])

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):
listC = list(map(int, input().split()))
listC.sort()

if listC[0]+ listC[1] == listC[2]:
    print("Yes")
else:
    print("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):
a = list(map(int, input().split()))
b = max(a)
a.remove(b)
if sum(a) == b:
  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):
abc = sorted(map(int, input().split()))
print ('Yes' if abc[0]+abc[1] == abc[2] else 'No')

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

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

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

Solution (Python):

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

Solution (Python):

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

Solution (Python):
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def ceil(a, b):
    return (a + b - 1) // b


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


if __name__ == '__main__':
    main()

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

Solution (Python):



a, b, c = [int(i) for i in input().split()]
n = max(a, b, c)
m = a + b + c - n
if n == m:
    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):
l = list(map(int, input().split()))

l.sort()



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

else:
    print("No")

Solution (Python):
x,y,z=sorted(map(int,input().split()));print('YNeos'[x+y!=z::2])

Solution (Python):
x,y,z=sorted(map(int,input().split()));print('YNeos'[x+y!=z::2])

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

Solution (Python):
a=list(map(int,input().split()))
a.sort()
print(['No','Yes'][max(a)-min(a)==a[1]])

Solution (Python):
a,b,c=map(int, input().split())
d=[a,b,c]
if sum(d)/2 in d: 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 b+c == a or c+a == b:
  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,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):
abc = list(map(int,input().split()))
abc.sort()

if abc[2]-(abc[1]+abc[0]) == 0:
    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):
abc = list(map(int,input().split()))
abc = sorted(abc)
if abc[0] + abc[1] == abc[2]:
    print('Yes')
else:
    print('No')

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

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

Solution (Python):
a = [int(i) for i in input().split()]
a.sort()
if int(a[0]) + int(a[1]) == int(a[2]):
    print('Yes')
else:
    print('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):
a,b,c=map(int,input().split());print("YNeos"[a+b!=c and a+c!=b and b+c!=a::2])

Solution (Python):
a,b,c=map(int,input().split())
ans="No"
if a+b==c or a+c==b or b+c==a:
    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):
na = lambda: list(map(int, input().split()))
a, b, c = na()
if a + b == c or b + c == a or c + a == b:
    print("Yes")
else:
    print("No")

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

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

Solution (Python):
import sys
import math
import collections
import itertools
import array
import inspect


sys.setrecursionlimit(1000000)



def chkprint(*args):
    names = {
        id(v): k
        for k, v in inspect.currentframe().f_back.f_locals.items()
    }
    print(', '.join(
        names.get(id(arg), '???') + ' = ' + repr(arg) for arg in args))



def to_bin(x):
    return bin(x)[2:]


def li_input():
    return [int(_) for _ in input().split()]


def gcd(n, m):
    if n % m == 0:
        return m
    else:
        return gcd(m, n % m)


def gcd_list(L):
    v = L[0]

    for i in range(1, len(L)):
        v = gcd(v, L[i])

    return v


def lcm(n, m):
    return (n * m) // gcd(n, m)


def lcm_list(L):
    v = L[0]

    for i in range(1, len(L)):
        v = lcm(v, L[i])

    return v



def wfs_d(D, N, K):
    """
    D: 隣接行列(距離付き)
    N: ノード数
    K: 始点ノード
    """

    dfk = [-1] * (N + 1)
    dfk[K] = 0

    cps = [(K, 0)]
    r = [False] * (N + 1)
    r[K] = True
    while len(cps) != 0:
        n_cps = []
        for cp, cd in cps:
            for i, dfcp in enumerate(D[cp]):
                if dfcp != -1 and not r[i]:
                    dfk[i] = cd + dfcp
                    n_cps.append((i, cd + dfcp))
                    r[i] = True

        cps = n_cps[:]

    return dfk



def dfs_d(v, pre, dist):
    """
    v:  現在のノード
    pre: １つ前のノード
    dist: 現在の距離

    以下は別途用意する
    D: 隣接リスト(行列ではない)
    D_dfs_d: dfs_d関数で用いる，始点ノードから見た距離リスト
    """

    global D
    global D_dfs_d

    D_dfs_d[v] = dist

    for next_v, d in D[v]:
        if next_v != pre:
            dfs_d(next_v, v, dist + d)

    return


def sigma(N):
    ans = 0
    for i in range(1, N + 1):
        ans += i
    return ans


class Combination:
    def __init__(self, n, mod):

        g1 = [1, 1]
        g2 = [1, 1]
        inverse = [0, 1]
        for i in range(2, n + 1):
            g1.append((g1[-1] * i) % mod)
            inverse.append((-inverse[mod % i] * (mod // i)) % mod)
            g2.append((g2[-1] * inverse[-1]) % mod)
        self.MOD = mod
        self.N = n
        self.g1 = g1
        self.g2 = g2
        self.inverse = inverse

    def __call__(self, n, r):
        if (r < 0 or r > n):
            return 0
        r = min(r, n - r)
        return self.g1[n] * self.g2[r] * self.g2[n - r] % self.MOD




dp = None


def main():
    a, b, c = li_input()

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


main()

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

Solution (Python):
x,y,z=sorted(map(int,input().split()));print(['No','Yes'][x+y==z])

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 = list(map(int,input().split()))
a.sort(reverse = True)
if a[0] == a[1] + a[2]:
    print("Yes")
else:
    print("No")

Solution (Python):


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

if __name__ == '__main__':
    main()

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):

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

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

Solution (Python):
a,b,c=map(int,input().split())
L=[]
L.append(a)
L.append(b)
L.append(c)
L=sorted(L)
if L[0]+L[1]==L[2]:
    print("Yes")
else :
    print("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 = list(map(int, input().split()))
if sum(a) / max(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 b + c == a or c + a == b:
    print('Yes')
else:
    print('No')

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

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

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):
def main():
    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")


if __name__ == '__main__':
    main()

Solution (Python):
l = list(map(int, input().split(" ")))
l = sorted(l, reverse=True)
if l[0] == (l[1] + l[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())
s = a+b+c
print("Yes" if (s % 2) == 0 and (s//2 in [a,b,c]) 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):
abc = map(int, input().split())

x = sorted(abc)
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+c == a or c+a == b:
    print("Yes")
else:
    print("No")

Solution (Python):
num,num_two,num_three = map(int,input().split())
sort = sorted([num,num_two,num_three])
print("Yes" if sort[0] + sort[1] == sort[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):
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):
ary = sorted([int(x) for x in input().split()])
if ary[0] + ary[1] == ary[2]:
    print("Yes")
else:
    print("No")

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

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

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

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

Solution (Python):

n=[int(i) for i in input().split()]
n.sort()
if(n[0]+n[1]==n[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):
bag=list(map(int,input().split()))
bag.sort()
if bag[0]+bag[1]==bag[2]:
    print("Yes")
else:
    print("No")

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

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

Solution (Python):
l = [int(x) for x in raw_input().split()]
print "Yes" if 2 * max(l) == sum(l) else "No"

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

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