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):
n = input().split()

a = int(n[0])
b = int(n[1])
c = int(n[2])

m = max([a,b,c])

if 2*m == a+b+c:
	print("Yes")
else:
	print("No")

Solution (Python):
List  = [int(i) for i in input().split()]
List.sort()
if List[2] ==List[0]+List[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())
d=max(a,b,c)
if a+b+c==d*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 a == b+c:
    print ("Yes")
else:
    print ("No")

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

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

Solution (Python):
a, b, c = map(int, raw_input().split())
total = a + b + c
if total % 2 != 0:
  print('No')
else:
  half = total // 2
  if a == half or b == half or c == half or a+b == half or b+c == half or a+c == half:
    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 == max(a, b, c)*2:
  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):
t=[int(i) for i in input().split()]
t.sort()
if t[2]==t[1]+t[0]:
    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):
x = list(map(int, input().split()))
x.sort()
print(["No","Yes"][2*x[2]==sum(x)])

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

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

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

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

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

Solution (Python):
a,b,c = map(int,input().split())
hanbun = (a+b+c) / 2
if a == hanbun or b == hanbun or c == hanbun:
    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=[int(s)for s in input().split()];a.sort();print("Yes" if a[0]+a[1]==a[2] 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,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

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

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

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

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

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

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

Solution (Python):
def judge(candy):
	for i in range(0, 3):
		if candy[i] == candy[(i+1)%3] + candy[(i+2)%3]: return 'Yes'
	return 'No'

print judge(map(int, raw_input().split()))

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

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

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

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

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

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

Solution (Python):
candy = list(map(int, input().split(' ')))
if sum(candy) == 3:
    print('No')
elif sum(candy) // 2 in candy:
    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()))

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

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

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

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

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

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

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

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

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

Solution (Python):





if __name__ == '__main__':
    candies = sorted(list(map(int, input().split())))

    first = sum(candies[:2])
    second = candies[2]

    if first == second:
        print('Yes')
    else:
        print('No')

Solution (Python):





if __name__ == '__main__':
    candies = list(map(int, input().split()))
    candies = sorted(candies)

    first = sum(candies[:2])
    second = candies[2]

    if first == second:
        print('Yes')
    else:
        print('No')

Solution (Python):
import math
import sys

def getinputdata():

    
    array_result = []
    
    data = input()

    
    array_result.append(data.split(" "))

    flg = 1

    try:


        while flg:

            data = input()

            array_temp = []

            if(data != ""):
                
                array_result.append(data.split(" "))

                flg = 1

            else:

                flg = 0
    finally:


        return array_result





arr_data = getinputdata()

a = int(arr_data[0][0])
b = int(arr_data[0][1])
c = int(arr_data[0][2])

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

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

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

if a>b:
    if a>c:
        max = a
    else:
        max = c
else:
    if a<=b:
        if c<b:
            max = b
        else:
            max = c

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

elif max == b:
    if b== a+c:
        print("Yes")
    else:
        print("No")
        
elif max == c:
    if c== b+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 = [int(n) for n in input().split()]

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

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

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

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

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

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

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

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

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

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

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

    s = sum([a, b, c])
    for x in (a, b, c):
        if s - x == x:
            print("Yes")
            return

    print("No")


if __name__ == '__main__':
    main()

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

Solution (Python):
a = map(int, raw_input().split())
s = sum(a)
m = max(a)
if s==2*m:
    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=map(int,input().split())
a=list(a)
a.sort()
if a[0]+a[1]==a[2]:
  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):
a = list(map(int,input().split()))
if max(a) == sum(a)-max(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):
x,y,z = map(int, input().split())
a = [x,y,z]
a.sort(reverse=True)

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

Solution (Python):





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

if __name__ == "__main__": main()

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

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

Solution (Python):
a,b,c=[int(x) for x in input().split()]
l=sorted([a,b,c])
print("Yes") if l[0]+l[1]==l[2] or l[0]==l[1]+l[2] else print("No")

Solution (Python):
l = map(int, raw_input().split())

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

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

Solution (Python):
print('Yes' if (lambda x: sum(x[:2]) == x[2])(sorted(map(int, input().split()))) else 'No')

Solution (Python):
def LI(): return [int(x) for x in input().split(" ")]
def LS(): return [str(x) for x in input().split(" ")]
def ItoS(L): return [str(x) for x in L]
def StoI(L): return [int(c) for c in L]


def solve():
    a, b, c = LI()
    if a + b == c or a + c == b or b + c == a:
        print("Yes")
    else:
        print("No")


solve()

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

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

Solution (Python):
print(("No","Yes")[0==sum(x*y for x,y in zip(sorted(map(int,input().split())),(1,1,-1)))])

Solution (Python):
s = list(map(int, input().split()))
s.sort()
if s[0]+s[1]==s[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):
n = input().split()
m = list(map(int, n))
m.sort()
if m[0] + m[1] == m[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 = 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()
    if A[0] + A[1] == A[2]:
        print("Yes")
    else:
        print("No")


if __name__ == "__main__":
    main()

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

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

li.sort()

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

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

sum = 0
for e in ls:
    sum += e

if max(ls) == (sum / 2):
    print("Yes")
else:
    print("No")

Solution (Python):

import math
import sys
import itertools
import numpy as np
import functools
import collections
mo = 1000000007
INF = 10**100
r = range

class infix(object):
    def __init__(self, function):
        self.function = function

    def __ror__(self, other):
        self.left = other
        return self

    def __or__(self, other):
        return self.function(self.left, other)

    def __call__(self, value1, value2):
        return self.function(value1, value2)

@infix
def c(f_t_u, f_u_r): return lambda t: f_u_r(f_t_u(t))

class _Ap(object):
    def __rlshift__(self, other):
        self.value = other
        return self

    def __rshift__(self, other):
        return other(self.value)
Ap = _Ap()
ap = Ap




x=map(int,input().split())<<ap>>list<<ap>>sorted
print('Yes' if x[0]+x[1]==x[2] else 'No')

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

Solution (Python):
a,b,c = map(int,input().split())
lis = [a,b,c]
lis = sorted(lis)
a=lis[0]
b=lis[1]
c=lis[2]

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

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

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

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

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

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

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

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

for x in a:
    if x * 2 == s:
        print('Yes')
        exit()

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):
a, b, c = map(int, raw_input().split())
max1 = max([a, b, c])
min2 = a + b + c - max1
if min2 == max1:
    print "Yes"
else:
    print "No"

Solution (Python):
n=list(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=map(int,input().split());print(["No","Yes"][a==b+c or b==c+a or c ==a+b])

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

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

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

Solution (Python):

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

a = sorted(a)

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

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

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

Solution (Python):
input_line1 = map(int,raw_input().split(" "))


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

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

Solution (Python):
from collections import defaultdict


def main():
    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, 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):
num = list(map(int, input().split()))

num = sorted(num)

if num[-1] == sum(num[:-1]):
    print("Yes")
else:
    print("No")

Solution (Python):
candy = input()
x = candy.split()
y = [0,0,0]
for i in range(3):
    y[i] = int(x[i])
i = 0
for v in y:
    if max(y) == v and y[(i+1)%3] + y[(i+2)%3] == v:
            print('Yes')
            break
    i = i+1
if i >= 3:
    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())
print( 'Yes' if (a+b)==c or (a+c)==b or (c+b)==a else 'No')

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

Solution (Python):
def ri(): return int(input())
def rli(): return list(map(int, input().split()))
def ris(): return list(input())
def pli(): return "".join(list(map(str, ans)))

a = rli()
if(max(a) == sum(a)/2):
    print("Yes")
else:
    print("No")

Solution (Python):
ABCstr=input().split()
ABC=[]
for num in ABCstr:
    ABC.append(int(num))
if ABC[0]==ABC[1]+ABC[2] or ABC[0]+ABC[1]==ABC[2] or ABC[0]+ABC[2]==ABC[1]:
    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):
a = list(map(int, input().split()))
total = sum(a)

for i in a:
    if total - i in a:
        print("Yes")
        break
else:
    print("No")

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

if a == b+c or b == a+c or c == b+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):
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,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 = 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):
def solve():
    a, b, c = map(int, input().split())
    if a == b + c:
        ans = "Yes"
    elif b == a + c:
        ans = "Yes"
    elif c == a + b:
        ans = "Yes"
    else:
        ans = "No"
    print(ans)

if __name__ == '__main__':
    solve()

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

ab = a + b
bc = b + c
ac = a + c

if(ab == c or bc == a or ac == b ):
    print("Yes")
else:
    print("No")

Solution (Python):
a, b, c = map(int, raw_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() ))
a.sort()
if a[0]+a[1]==a[2]:
  print("Yes")
else:
  print("No")

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

import numpy as np
maxi = np.argmax(L)
maxv = L.pop(maxi)

if maxv == sum(L):
    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 = map(int,raw_input().split())

a.sort(reverse=True)

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

Solution (Python):
candies = map(int, input().split())
lst = sorted(candies)
if lst[0] + lst[1] == lst[2]:
    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):
candy = [int(i) for i in input().split()]
candy = sorted(candy)
if(candy[0]+candy[1]==candy[2]):
	print("Yes")
else:
	print("No")

Solution (Python):
a, b, c = map(int, raw_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())

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

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

if max(l[0], l[1], l[2]) == (l[0] + l[1] + l[2]) / 2:
    print("Yes")
else:
    print("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=map(int,raw_input().split())
l=[]
for i in range(3):
    for j in range(i+1,3):
        l.append(a[i]+a[j])

an='No'

for k in l:
    if k in a:
        an='Yes'
        break

print an

Solution (Python):
a,b,c=map(int,input().split())
s=sum([a,b,c])
if s-a==a or s-b==b or s-c==c:
    print("Yes")
else:
    print("No")

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

Solution (Python):
candies = [int(e) for e in input().split()]
lst = sorted(candies)


def main(lst):
    max = lst[2]

    if max == lst[0] + lst[1]:
        return 'Yes'
    else:
        return 'No'


if __name__ == '__main__':
    ans = main(lst)
    print(ans)

Solution (Python):
import sys

def debug(x, table):
    for name, val in table.items():
        if x is val:
            print('DEBUG:{} -> {}'.format(name, val), file=sys.stderr)
            return None

def solve():
    a = [int(i) for i in input().split()]
    a.sort()

    if a[0] + a[1] == a[2]:
        ans = 'Yes'
    else:
        ans = 'No'

    print(ans)


if __name__ == '__main__':
    solve()

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

Solution (Python):

abc = list(map(int,input().split()))
index = abc.index(max(abc))
factor = 0
for tmp in range (0, len(abc)):
    if tmp != index:
        factor += abc[tmp]
    else:
        continue

if abc[index] == factor:
    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([int(i) for i in input().split()])
suma = sum(a) / 2
if sum(a) % 2 == 0 and suma == a[2] or suma == a[0] + a[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):
x = [ int(i) for i in input().split()]
if 2 * max(x) == sum(x):
  print("Yes")
else:
  print("No")

Solution (Python):

f = True
List = []

List = map(int,raw_input().split())


List.sort()

if not List[0]+List[1] == List[2]:
    f = False


if f:
    print 'Yes'
else:
    print 'No'

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

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

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

Solution (Python):
abc = list(map(int , input().split()))
flg = False
for i in range(1<<3):
    v = [0]*2
    tmp = i
    for j in range(3):
        v[tmp%2] += abc[j]
        tmp = tmp // 2
    if v[0] == v[1]:
        flg = True

if flg:
    print("Yes")
else:
    print("No");

Solution (Python):
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time

sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7

def LI(): return list(map(int, input().split()))
def II(): return int(input())
def S(): return input()


def main():
    a = LI()
    if sum(a)  == max(a)*2:
        return 'Yes'
    return 'No'


print(main())

Solution (Python):
s=map(int,raw_input().split());print"Yes"*(sum(s)==2*max(s))or"No"

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

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