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):
inp = [int(x) for x in input().split()]

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

cand_max = max(inp)
inp.remove(cand_max)

if cand_max == inp[0] + inp[1]:
    print("Yes")
else:
    print("No")

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

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

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

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

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 = list(map(int,input().split()))
print("Yes" if sum(a)/2 in a and sum(a) % 2 == 0 else "No")

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

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

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

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

Solution (Python):
A, B, C = sorted([int(x) for x in input().split()])
if A + B == C:
  print("Yes")
else:
  print("No")

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

X_sort=sorted(X, reverse=True)
if X_sort[0]==X_sort[1]+X_sort[2]:
    print('Yes')
    
else:
    print('No')

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

X_sort=sorted(X, reverse=True)
if X_sort[0]==X_sort[1]+X_sort[2]:
    print('Yes')
    
else:
    print('No')

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

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

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

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

candy_sum = sum(candy)

res = 0
for i in candy:
    if candy_sum - i == i:
        res = 1

if res == 1:
    print("Yes")
else:
    print("No")

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

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

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

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

i = 0

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

Solution (Python):
from collections import Counter, defaultdict
import sys
sys.setrecursionlimit(10 ** 5 + 10)

from math import factorial
import bisect



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

import sys
sys.setrecursionlimit(300000)

YES = "Yes"  
NO = "No"  

def solve(a: int, b: int, c: int):
    ret = NO
    s = a + b + c
    if s % 2 == 0 and (a == s // 2 or b == s // 2 or c == s // 2):
        ret = YES
    print(ret)
    return


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    a = int(next(tokens))  
    b = int(next(tokens))  
    c = int(next(tokens))  
    solve(a, b, c)

if __name__ == '__main__':
    main()

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

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

Solution (Python):
abc=[int(x) for x in input().split()]
abc.sort()
if sum(abc)==abc[-1]*2:
  print('Yes')
else:
  print('No')

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

Solution (Python):

import sys

YES = "Yes"  
NO = "No"  

def solve(a: int, b: int, c: int):
    s = (a + b + c) / 2

    if s in [a, b, c]:
        print('Yes')
    else:
        print('No')
    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    a = int(next(tokens))  
    b = int(next(tokens))  
    c = int(next(tokens))  
    solve(a, b, c)

if __name__ == '__main__':
    main()

Solution (Python):



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


l.sort()


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

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

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

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

Solution (Python):
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,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):
lst = list(map(int, input().split()))
lst.sort()
if sum(lst[:2]) == lst[2]:
  print("Yes")
else:
  print("No")

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

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

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

Solution (Python):

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

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

elif candy[0] + candy[2] == candy[1]:
    print("Yes")
    
elif candy[1] + candy[2] == candy[0]:
    print("Yes")

else:
    print("No")

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

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

from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
bisect_left = bisect.bisect_left
bisect_right = bisect.bisect_right
def LI(): return list(map(int, stdin.readline().split()))
def LF(): return list(map(float, stdin.readline().split()))
def LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))
def II(): return int(stdin.readline())
def IF(): return float(stdin.readline())
def LS(): return list(map(list, stdin.readline().split()))
def S(): return list(stdin.readline().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')


def A():
    a, b, c = LI()
    if a == b + c:
        print("Yes")
    elif b == a + c:
        print("Yes")
    elif c == a + b:
        print("Yes")
    else:
        print("No")
    return


def B():
    return


def C():
    return


def D():
    return


def E():
    return


def F():
    return


def G():
    return


def H():
    return


if __name__ == '__main__':
    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):
l=sorted(list(map(int, input().split())))
print('YNeos'[l[0]+l[1]-l[2]!=0::2])

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

if nums[0] + nums[1] == nums[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())
l = [a,b,c]
ld = sorted(l, reverse=True)
max = ld[0]
mix = ld[1]+ld[2]
if max==mix :
  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 = 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:
    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 b+c == a or c+a == b:
  print('Yes')
else:
  print('No')

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

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

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

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

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

if __name__ == '__main__':
    main()

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

Solution (Python):


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

if __name__ == "__main__":
    solve()

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

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

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

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

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

Inp = [a,b,c]
Sum = 0
max_num = max(Inp)
Inp.remove(max_num)
for i in Inp: Sum += i
if max_num == Sum: print('Yes') 
else: print('No')

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

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

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

d = max(a,b,c)

sum = a+b+c

if d == sum-d:
    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 = [int(x) for x in input().split()]
a.sort()
if sum(a[0:2]) == a[2]:
  print('Yes')
else:
  print('No')

Solution (Python):
nl = lambda: list(map(int, input().split()))
sl = lambda: input().split()
n = lambda: int(input())
s = lambda: input()

a, b, c = nl()

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

Solution (Python):
lst = list(map(int, input().split()))
if max(lst)==sum([i for i in lst if i!=max(lst)]):
  print("Yes")
else:
  print("No")

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

if max(a,b,c) == sum([a,b,c])-max(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 = list(map(int, input().split()))
a.sort()

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

Solution (Python):
x, y, z = map(int, input().split())

t = max(x, y, z) - min(x, y, z)

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

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

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

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

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

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

Solution (Python):
import itertools

a = list(map(int,(input().split(' '))))
c = list(itertools.combinations(a, 2))



a.sort()

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

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


abc()

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

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

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

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

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

ans = "No"

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

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

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

Solution (Python):
a,b,c=map(int, input().split())
[x,y,z]=sorted([a,b,c], reverse=True)
if y+z==x:
    print("Yes")
else: print("No")

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

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

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

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

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

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

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

Solution (Python):


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

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

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

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

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

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

Solution (Python):
A, B, C = [int(x) for x in input().split()]
print('Yes') if A == (B+C) or B == (A+C) or C == (A+B) else print('No')

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

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

Solution (Python):
A=list(map(int,input().split()))
if max(A)*2==sum(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):

import copy
import random
import bisect 
import fractions 
import math
import sys

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


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(' '))
s = sorted(list((a,b,c)))

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

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

Solution (Python):

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

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

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

Solution (Python):

import sys
def input(): return sys.stdin.readline().rstrip()
def mi(): return map(int, input().split())


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

Solution (Python):



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


abc_list.sort()



a, b, c = abc_list





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

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

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

Solution (Python):
import sys, os

f = lambda:list(map(int,input().split()))
if 'local' in os.environ :
    sys.stdin = open('./input.txt', 'r')

def solve():
    a = f()
    if sum(a) - max(a) == max(a):
        print('Yes')
    else:
        print('No')

solve()

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

Solution (Python):
l = map(int,raw_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(' '))

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

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

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

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

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

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

Solution (Python):

"""
A - キャンディーと2人の子供 / Fighting over Candies
https://atcoder.jp/contests/abc047/tasks/abc047_a

"""
import sys


def solve(a, b, c):
    candies = sorted([a, b, c])
    if candies[0] + candies[1] == candies[2]:
        return 'Yes'
    return 'No'


def main(args):
    a, b, c = map(int, input().split())
    ans = solve(a, b, c)
    print(ans)


if __name__ == '__main__':
    main(sys.argv[1:])

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

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

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

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

Solution (Python):
values = list(map(int, input().split()))
values = sorted(values)
if values.pop() == sum(values):
    print('Yes')
else:
    print('No')

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

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

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

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

print("YNeos"[l[0]+l[1]!=l[2]::2])

Solution (Python):
s=sorted(list(map(int,input().split())))
print('NYoe s'[s[-1]==sum(s[:2])::2])

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

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

Solution (Python):

l = list(map(int, input().split()))
l.sort()
m = l[-1]
l.pop()
if sum(l) == m:
    print('Yes')
else:
    print('No')

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

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

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

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

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

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

answer=sorted(nums,reverse=True)

if sum(answer)%2==0 and answer[0]==answer[1]+answer[2]:
	print("Yes")

else:
	print("No")

Solution (Python):



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


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

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

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

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

max_ = max(candy)

print("Yes" if (sum(candy)-max_ == max_) 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 copy

l = [int(n) for n in input().split()]
l_ = copy.copy(l)

for i in range(3):
    l_ = copy.copy(l)
    k = l_[i]
    del l_[i]
    if sum(l_) == k:
        print('Yes')
        break
    
else:
    print('No')

Solution (Python):
import sys

S = [int(i) for i in input().split()]
T = sum(S)/2

for i in range(3):
  if S[i] == T:
    print("Yes")
    sys.exit()
    
print("No")

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

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

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

Solution (Python):
abc = [int(s) for s in input().split()]
abc.sort()

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

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