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

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

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

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

if(a+b==c or b+c==a or c+a==b):
    ans="Yes"

print(ans)

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

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

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

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

Solution (Python):
ka = list(map(int, input().split()))
ka.sort()
if ka[2]==ka[0]+ka[1]:
    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):
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
INF = 10**9
mod = 10**9+7

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

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

Solution (Python):


def main():

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

    lists.sort()

    if lists[2] == lists[1] + lists[0]:
        print('Yes')

    else:
        print('No')


if __name__ == "__main__":
    main()

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

Solution (Python):
from itertools import combinations as comb


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


if __name__ == "__main__":
    main()

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()))
print('Yes' if sum(A)/2 in A else 'No')

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

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

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

print('Yes') if sum(l) / 2 in l else print('No')

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

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

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

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

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

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

resolve()

Solution (Python):
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


def main():
    C = list(map(int, readline().split()))
    C.sort()

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

    return


if __name__ == '__main__':
    main()

Solution (Python):
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


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

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

    return


if __name__ == '__main__':
    main()

Solution (Python):
c=list(map(int,input().split()))
c.sort()
if c[0]+c[1]==c[2]:
    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):
import sys
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))  

A = LI()
A.sort()

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

Solution (Python):
a = sorted(list(map(int, input().split())))
if a[-1] == sum(a[: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) else 'No')

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

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

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

if 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=sorted(map(int,input().split()))
print('NYoe s'[a+b==c::2])

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

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

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

Solution (Python):
l=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=map(int,input().split())
if a+b+c-min(a,b,c)==(a+b+c)/2:
    print("Yes")
elif a+b+c-max(a,b,c)==(a+b+c)/2:
    print("Yes")
else:
    print("No")

Solution (Python):
import sys

def main(a,b,c):
    if (a+b-c)*(b+c-a)*(c+a-b)==0:
        return 'Yes'
    else:
        return 'No'

a,b,c=map(int,sys.stdin.readline().strip().split())
print(main(a,b,c))

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

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

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

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

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

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

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

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

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

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

Solution (Python):
import sys
import math
import itertools
import collections
import heapq
import re
import numpy as np

rr = lambda: sys.stdin.readline().rstrip()
rs = lambda: sys.stdin.readline().split()
ri = lambda: int(sys.stdin.readline())
rm = lambda: map(int, sys.stdin.readline().split())
rl = lambda: list(map(int, sys.stdin.readline().split()))
inf = float('inf')
mod = 10**9 + 7

a = rl()
t = sum(a)/2
if t in a:
  print('Yes')
else:
  print('No')

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

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

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

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

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

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

if sum(a[:2]) == a[2]:
    print('Yes')
else:
    print('No')

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

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

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

S = a + b + c
M = max([a, b, c])
if S - M == 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 A+C == B or A == B+C:
  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 == a + c or c == a + b:
  print('Yes')
else:
  print('No')

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

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

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

num.sort()

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

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

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

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

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

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

Solution (Python):

lst = input().split()


for i in range(len(lst)):
   lst[i] = int(lst[i])


lst.sort()


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

Solution (Python):
A = list(map(int,input().rstrip().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:
  print("Yes")
elif b+c==a:
  print("Yes")
elif 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):
print('NYoe s'[' 2'in(s:=input())or' 5'in s::2])

Solution (Python):
from fractions import gcd
from collections import Counter, deque, defaultdict
from heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge
from bisect import bisect_left, bisect_right, bisect, insort_left, insort_right, insort
from itertools import accumulate, product, permutations, combinations

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

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

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

import sys, re
from decimal import *
from collections import deque, defaultdict, Counter, OrderedDict
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, floor, trunc, log
from heapq import heappush, heappop, heapify, nlargest, nsmallest
def STR(): return list(input())
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def list2d(a, b, c): return [[c] * b for i in range(a)]
def sortListWithIndex(listOfTuples, idx):   return (sorted(listOfTuples, key=lambda x: x[idx]))
def sortDictWithVal(passedDic):
    temp = sorted(passedDic.items(), key=lambda kv: (kv[1], kv[0]))
    toret = {}
    for tup in temp:
        toret[tup[0]] = tup[1]
    return toret
def sortDictWithKey(passedDic):
    return dict(OrderedDict(sorted(passedDic.items())))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

a = LIST()

a.sort()

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

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

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

else:
    print("No")

Solution (Python):
def actual(a, b, c):
    if (a + b) == c or (b + c) == a or (c + a) == b:
        return 'Yes'

    return 'No'

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

Solution (Python):


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

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

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

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

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

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

Solution (Python):


def read_int():
    return int(input().strip())


def read_ints():
    return list(map(int, input().strip().split(' ')))


def solve():
    packs = read_ints()
    S = sum(packs)
    for pack in packs:
        if pack == S-pack:
            return 'Yes'
    return 'No'


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

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):
def candy():
    s = input()
    slist = s.split(' ')

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

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

candy()

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

lst.sort(reverse= 1)

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

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

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

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

Solution (Python):
a,b,c=map(int,input().split())
if a+b==c or a+c==b or b+c==a:
    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):
import sys
import numpy as np
import random
import math
from decimal import Decimal
import itertools
import re
import bisect
from collections import deque, Counter
from functools import lru_cache

sys.setrecursionlimit(10**9)
INF = 10**13
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def I(): return int(sys.stdin.buffer.readline())
def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()
def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]
def SERIES(n): return np.fromstring(sys.stdin.buffer.read(), dtype=np.int32, sep=' ')
def GRID(h,w): return np.fromstring(sys.stdin.buffer.read(), dtype=np.int32, sep=' ').reshape(h,-1)[:,:w]
def GRIDfromString(h,w): return np.frombuffer(sys.stdin.buffer.read(), 'S1').reshape(h,-1)[:,:w]
MOD = 1000000007

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


if __name__ == '__main__':
    main()

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

if max(candy_list) == (sum(candy_list) - max(candy_list)):
    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):
As = sorted(list(map(int, input().split())))
if As[0] + As[1] == As[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 print('No')

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

Solution (Python):
i = [int(s) for s in input().split()]
m = max(i)
i.remove(m)
a = i[0] + i[1]

if a == m:
    print("Yes")
else:
    print("No")

Solution (Python):


"""
int 
float 


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

print(a)
ptrint("Hello")

for name in fruits: 
    print(name)

list0 = [] 
list0 = [1,2,3,4] 
list0 = [0]*10 
list1 = list(map(int, input().split()))　
list1 = list1 + [6, 7, 8] 
list2.append(34) 
list.insert(3,10) 
len(list4) 
max(sa) 
list5.count(2) 
abs(a) 
max(a,b) min(a,b) 

extension_1 = []
for i in range(10):
    extension_1.append(i)
extension_1


comprehension_1= [i for i in range(10)]
comprehension_1

"""
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):
import sys
l = list(map(int,input().split()))

for i in range(3):
    if l[i] == sum(l[:i]+l[i+1:]):
        print('Yes')
        sys.exit()
print('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:
    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())
x=sorted([a,b,c])
if x[0]+x[1]==x[2]:
    print("Yes")
else:
    print("No")

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7


def resolve():
    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__':
    resolve()

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

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

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

Solution (Python):
import sys
sys.setrecursionlimit(10**8)
def ii(): return int(sys.stdin.readline())
def mi(): return map(int, sys.stdin.readline().split())
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for _ in range(N)]
def dp2(ini, i, j): return [[ini]*i for _ in range(j)]





L = sorted(li())

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

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

Solution (Python):
g = sorted([int(i) for i in input().split()])
if sum(g[:-1]) == g[-1]: 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(" "))

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

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

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

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

Solution (Python):
s = list(map(int, input().split()))
if(sum(s)%2==1):
  print("No")
else:
  if(max(s) == (sum(s)//2)):
    print("Yes")
  else:
    print("No")

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

Solution (Python):
A, B, C = map(int,input().split())
x = max(A,B,C)
y = sum([A,B,C]) - x

if x == y:
    print('Yes')
else:
    print('No')

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

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

Solution (Python):
l=[int(x) for x in input().split()]

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

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

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

if a+b-c==0 or b+c-a==0 or c+a-b==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):
import sys
def v():
    a,b,c=tuple(map(int,sys.stdin.readline().split()))
    if any([a==b+c,b==c+a,c==a+b]):print('Yes')
    else:print('No')
if __name__=='__main__':v()

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

Solution (Python):
a =  list(map(int, input().split()))
if any([a[0]+a[1] ==a[2] ,a[0]+a[2] ==a[1] ,a[1]+a[2] == a[0]]):
    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 = input().split()
a = int(a)
b = int(b)
c = int(c)
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  = list(map(int,input().split()))

a = sorted(A)

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

Solution (Python):
a,b,c = (int(x) for x in input().split())
half_pack = int((a+b+c)/2)
if(a == half_pack) and ((b+c) == half_pack):
    print("Yes")
elif(b == half_pack) and ((a+c) == half_pack):
    print("Yes")
elif(c == half_pack) and ((b+a) == half_pack):
    print("Yes")
else:
    print("No")

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

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

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

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

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

Solution (Python):
l = input()
arr = l.split(' ')
arr = [int(e) for e in arr]

if 1 <= arr[0] <= 100 and 1 <= arr[1] <= 100 and 1 <= arr[2] <= 100:
  if arr[0] == arr[1] + arr[2]:
    print('Yes')
  elif arr[1] == arr[2] + arr[0]:
    print('Yes')
  elif arr[2] == arr[0] + arr[1]:
    print('Yes')
  else:
    print('No')

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

Solution (Python):
import sys
sys.setrecursionlimit(10**6)
input = lambda: sys.stdin.readline().rstrip()
inf = float("inf") 
a = list(map(int,input().split()))
for i in range(1,(2**3)-1):
    distribution = [0,0]
    
    for j in range(3):
        distribution[(i>>j)&1]+= a[j]
    if distribution[0] == distribution[1]:
        break
if distribution[0] == distribution[1]:
    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 = [int(i) for i in input().split()]

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

Solution (Python):
from sys import stdin
input = stdin.readline
import copy as cp
from collections import deque

def VI(N, init=0):
  return [init for _ in range(N)]
def VVI(N, M, init=0):
  return [[init for _ in range(M)] for _ in range(N)]

def VD(N, init=0.0):
  return [init for _ in range(N)]
def VVD(N, M, init=0.0):
  return [[init for _ in range(M)] for _ in range(N)]

def Decimal(x):
  print("{0:.10f}".format(x))

class Pair:
  def __init__(self, x=0, y=0):
    self.first = x
    self.second = y

  def __repr__(self):
    return '{0} {1}'.format(self.first, self.second)

  def __lt__(self, pi):
    return self.first < pi.second

def POW(x, n):
  ret = 1
  while n:
    if n&1:
      ret *= x
    x *= x
    n >>= 1
  return ret

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

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

Solution (Python):

import heapq

a,b,c = map(int, input().split())
l = [a,b,c]
l2 = heapq.nsmallest(3, l)
if (l2[0] + l2[1]) == max(l):
  print('Yes')
else:
  print('No')

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

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

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