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

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

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

Solution (Python):
candy = [int (_) for _ in 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())
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())

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):
candy = list(map(int, input().split(" ")))
if sum(candy)-max(candy) == max(candy):
  print("Yes")
else:
  print("No")

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

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

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

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

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

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

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

C.sort()

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

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

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

Solution (Python):
def slove():
    import sys
    input = sys.stdin.readline
    abc = list(map(int, input().rstrip('\n').split()))
    abc.sort()
    if sum(abc[:2]) == abc[-1] or abc[0] == sum(abc[1:]):
        print("Yes")
    else:
        print("No")


if __name__ == '__main__':
    slove()

Solution (Python):
can = list(map(int,input().split()))
can_sort = sorted(can)
print('Yes' if can_sort[0]+can_sort[1]==can_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):
candy = list(map(int, input().split()))
candy.sort()

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

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

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

Solution (Python):
ls = list(map(int, input().split()))
s = sum(ls)
for i in range(3):
    if s % 2 == 0 and ls[i] == s // 2:
        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 == a+b:
    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):
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):
import sys

input = sys.stdin.readline


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


if __name__ == "__main__":
    main()

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

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

Solution (Python):

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

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


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

Solution (Python):

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

Solution (Python):
a= list(map(int, input().split()))
max_a = max(a)
a.remove(max_a)
if sum(a) == max_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 = list(map(int,input().split()))
a.sort()
if sum(a)-a[-1]==a[-1]:
    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, b, c = map(int, input().split())

sm = a + b + c

if sm / a == 2 or sm / b == 2 or sm / c == 2:
    ans = "Yes"
else:
    ans = "No"

print(ans)

Solution (Python):
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
def do():
    a = LIST()
    a.sort()
    if a[0]+a[1]==a[2]:
        print('Yes')
    else:
        print('No')
    
if __name__ == '__main__':
    do()

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

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

if set1 == c or set2 == b or set3 == a:
  print('Yes')
else:
  print('No')

Solution (Python):


candy = sorted(list(map(int, input().split())), reverse=True)

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

Solution (Python):
input_ = input().split()

a, b, c = input_
a, b, c = int(a), int(b), int(c)

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):
def main():
  packs = [int(x) for x in raw_input().split()]
  if packs[0] == packs[1]+packs[2]:
      print("Yes")
      return
  if packs[1] == packs[0]+packs[2]:
      print("Yes")
      return
  if packs[2] == packs[0]+packs[1]:
      print("Yes")
      return
  print("No")
  

main()

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

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


if __name__ == "__main__":
    resolve()

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

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

Solution (Python):
l=list(map(int,input().split()))
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 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)*2 ==0:
    print('Yes')
else:
    print('No')

Solution (Python):
s=list(input().split())
for i in range(len(s)):
  s[i]=int(s[i])
if sum(s)-2*max(s)==0:
  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 = 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):
lst = list(map(int, input().split()))
lst.sort()

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

Solution (Python):
a,b,c = map(int, input().split())
print("Yes" if max(a,b,c) == (sum([a,b,c]) - max(a,b,c)) else "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):
import sys
input = sys.stdin.readline

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

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


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

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

Solution (Python):
A=[int(x) for x 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())

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

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

s_max = max(s)
s.remove(s_max)

if sum(s) == s_max:
    print("Yes")
else:
    print("No")

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

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

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

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

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

if a + b == c:
    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):
list = list(map(int,input().split()))

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

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

Solution (Python):
a,b,c=sorted(map(int,input().split()));print('YNeos'[a+b!=c::2])

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

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

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

Solution (Python):
packs = [int(x) for x in input().split()]
for p in packs:
    if p == sum(packs) / 2:
        print("Yes")
        break
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 = map(int,input().split())
print('Yes') if a == b+c or b == a+c or c == a+b 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, input().split())
X = [a, b, c]
X.sort()
if X[2] == (X[0]+X[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):
c=list(map(int,input().split()))
c=sorted(c)
if c[0]+c[1]==c[2]:
  print("Yes")
else:
  print("No")

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

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

div = (a + b + c) / 2

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

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

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

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

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

Solution (Python):
import sys
from collections import Counter

stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline()

mod = 10 ** 9 + 7

li = na()
li.sort()
print('Yes' if li[0] + li[1] == li[2] 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):
candy_packs = [int(x) for x in input().split()]
print('Yes' if max(candy_packs) == sum(candy_packs)/2 else 'No')

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

Solution (Python):
List = [int(i) for i in input().split()]
List.sort()
if List[0]+List[1]==List[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())
chk = A+B+C
if 2*A == chk or 2*B == chk or 2*C == chk:
  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==b+a:
  print('Yes')
else:
  print('No')

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

if 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 = sorted(list(map(int,input().split())))
print("Yes" if a.pop()==sum(a) else "No")

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

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

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 = sorted(map(int, input().split()))
if a + b == c:
    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 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 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())
sum = A + B + C
M = max([A, B, C])
if M == sum - M:
    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 = sorted(list(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+c==a:
	print("Yes")
elif a+c==b:
	print("Yes")
else:
	print("No")

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

x = a+b
y = b+c
z = c+a

if x ==c or y ==a or z ==b:
  print('Yes')
else:
  print('No')

Solution (Python):
a,b,c=map(int,input().split());print('YNeos'[a+b!=c!=abs(a-b)::2])

Solution (Python):
a,b,c=map(int,input().split());print('NYoe s'[c in(a+b,a-b,b-a)::2])

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

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

Solution (Python):
a,b,c=map(int,input().split())
print('YNeos'[(a+b!=c)&(b+c!=a)&(c+a!=b)::2])

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

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

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

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

Solution (Python):
x = list(map(int,input().split()))
x.sort(reverse=True)
if x[1] + x[2] == x[0]:
  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 a+c == 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):
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
import copy
import collections
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush, heapify
import math
import itertools
import random
 




 
INF = float('inf')
def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))
 
def main():
    a,b,c = inputMap()
    
    tot = a+b+c
    cc = max(a,b,c)
    
    if tot - cc == cc:
        print("Yes")
    else:
        print("No")
    
    
if __name__ == "__main__":
	main()

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

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

Solution (Python):
a, b, c = map(int, input().split())
nyuryoku = [a, b, c]
saidai = max(nyuryoku)
nyuryoku.remove(saidai)

if saidai == sum(nyuryoku):
    print('Yes')
else:
    print('No')

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


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

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

Solution (Python):
a=list(map(int,input().split()));print("NYoe s"[sum(a)/2 in a::2])

Solution (Python):
a,b,c=map(int,input().split());print("NYoe s"[(a+b+c)/2 in[a,b,c]::2])

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

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

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

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

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

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

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

Solution (Python):
A = [int(i) for i in 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())
a, b, c = sorted([a, b, c])
if a+b == c:
  print("Yes")
else:
  print("No")

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

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

s = sorted([a, b, c])

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

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

Solution (Python):
s = list(map(int,input().split()))
flag = False
if s[0]+s[1] == s[2]:
    flag = True
elif s[0]+s[2]==s[1]:
    flag = True
elif s[0] == s[1]+s[2]:
    flag = True

if flag:
    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 = sorted(map(int, input().split()))
print('Yes' if a + b == c else 'No' )

Solution (Python):
import sys
import bisect
input = sys.stdin.readline
 
def main():
    s = list(map(int,input().split()))
    s.sort()
    
    if(s[0]+s[1]==s[2]):
        print("Yes")
    else:
        print("No")
    
main()

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

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

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

print("Yes" if A+B == C else "No")

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

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

a.sort()

if a[0] + a[1] == a[2] or 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 a+c == b or b+c == a:
    print("Yes")
else:
    print("No")

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

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

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

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