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 = [int(x) for x in input().split()]
p = sorted([a, b, c])
if (p[0]+p[1])==p[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,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()))
print("Yes" if max(a)*2==sum(a) else "No")

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

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

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

Solution (Python):
import math
import queue
import bisect
import heapq
import time
import itertools

mod = int(1e9+7)

def swap(a,b):
    return (b,a)

def gcd(a,b): 
    if (a<b):
        a,b = swap(a,b)
    if (b==0):
        return a
    else:
        return gcd(b,a%b)

def divisors(a): 
    divisors = []
    for i in range(1,int(a**0.5)+1):
        if a%i==0:
            divisors.append(i)
            if i!=a//i:
                divisors.append(a//i)
    return divisors

def is_prime(a): 
    if a<2:
        return False
    elif a==2:
        return True
    elif a%2==0:
        return False
    sqrt_num = int(a**0.5)
    for i in range(3,sqrt_num+1,2):
        if a%i==0:
            return False
    return True

def prime_num(a): 
    pn = [2]
    for i in range(3,int(a**0.5),2):
        prime = True
        for j in pn:
            if i%j==0:
                prime = False
                break
        if prime:
            pn.append(i)
    return pn

def main():
    x = [y for y in map(int,input().split())]
    x.sort()
    if x[0]+x[1]==x[2]:
        print("Yes")
    else:
        print("No")
    return

if __name__=='__main__':
    main()

Solution (Python):
a, b, c = map(int, input().split())
lst = sorted([a, b, c])

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

Solution (Python):

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

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

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

Solution (Python):
import math

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

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

Solution (Python):
import sys

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

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

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

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

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

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

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

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

Solution (Python):
A=list(map(int,input().split()));print(("No","Yes")[sum(A)/2 in A])

Solution (Python):
candies=list(map(int,input().split()))
for i in range(2**3):
  divide=[0]*2
  for j in range(3):
    divide[(i>>j)&1]+=candies[j]
  if divide[0]==divide[1]:
    print("Yes")
    break
else:
  print("No")

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

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

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

Solution (Python):
import sys

*candies, = map(int, sys.stdin.readline().split())

def main():
    candies.sort()
    if candies[0] + candies[1] == candies[2]:
        return 'Yes'
    return 'No'

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

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

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 sum(a)==a[-1]*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 = 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) == 2 * max(a, b, c):
	print('Yes')
else:
	print('No')

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

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

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

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

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

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

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

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

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

hantei_flag = 0

if(x == (y+z)):
    hantei_flag=1
elif(y == (z+x)):
    hantei_flag=1
elif(z == (x+y)):
    hantei_flag=1

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

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

Solution (Python):

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

P = [a,b,c]

P.sort(reverse=True)
if P[0] == P[1] +P[2]:
    print('Yes')
else:
    print('No')

Solution (Python):

si = lambda: input()
ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))
a,b,c = nm()
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()))

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

Solution (Python):
candy_bag = list(map(int, input().split()))
max_bag_num = max(candy_bag)
bag = 0
small_bag_sum = 0
for bag in candy_bag:
	if bag == max_bag_num:
		continue
	else:
		small_bag_sum += bag

if max_bag_num == small_bag_sum:
	print("Yes")
else:
	print("No")

Solution (Python):
n = list(int(x) for x in input().split())

n.sort()

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

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

m = max(lst)
if sum(lst) == 2*m:
  print('Yes')
else:
  print('No')

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

packs.sort()

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

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

lis = [a,b,c]
lis.sort(reverse=True)

if lis[0] == lis[1] + lis[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())
s=a+b+c

if s%2==0:
    if a+b==c:
        print("Yes")
    elif a+c==b:
        print("Yes")
    elif c+b==a:
        print("Yes")
    else:
        print("No")
else:
    print("No")

Solution (Python):
from sys import stdin

a,b,c = [int(x) for x in stdin.readline().rstrip().split()]

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

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

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

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

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

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

count=[a,b,c]
d =max(count)
v=0
count.remove(d)
for i in range(len(count)):
    v += count[i]

if v ==d :
    print('Yes')

else:
    print('No')

Solution (Python):

import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)

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

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

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

Solution (Python):
list=sorted(list(map(int,input().split())))
print("Yes" if list[0]+list[1]==list[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=list(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
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,ceil,sqrt,factorial,log 
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
inf=float('inf')
mod = 10**9+7
def pprint(*A): 
    for a in A:     print(*a,sep='\n')
def INT_(n): return int(n)-1
def MI(): return map(int,input().split())
def MF(): return map(float, input().split())
def MI_(): return map(INT_,input().split())
def LI(): return list(MI())
def LI_(): return [int(x) - 1 for x in input().split()]
def LF(): return list(MF())
def LIN(n:int): return [I() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]
def LLIN_(n: int): return [LI_() for _ in range(n)]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def I(): return int(input())
def F(): return float(input())
def ST(): return input().replace('\n', '')
def main():
    A=LI()
    print("YNeos"[sum(A)/2 not in A::2])
if __name__ == '__main__':
    main()

Solution (Python):
import math
from string import ascii_lowercase
 
line = input()
a, b, c = [int(x) for x in line.split()]
 
if (max(a, b, c) * 2 == a + b + c):
	print("Yes")
else :
	print("No")

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

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

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

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

A_B = (a+b)
A_C = (a+c)
B_C = (b+c)

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

A_B = (a+b)
A_C = (a+c)
B_C = (b+c)

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

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

Solution (Python):

import sys, itertools
from fractions import gcd
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
sys.setrecursionlimit(10**8)
inf = float('inf')
ans = count = 0



a, b, c = map(int, input().split())
for i in itertools.permutations([a, b, c], 3):
    if i[0] == sum(i[1:]) or sum(i[:2]) == i[2]:
        print("Yes")
        exit()

print("No")

Solution (Python):

import sys, itertools ,fractions
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
sys.setrecursionlimit(10**8)
inf = float('inf')
ans = count = 0



a, b, c = map(int, input().split())
for i in itertools.permutations([a, b, c], 3):
    if i[0] == sum(i[1:]) or sum(i[:2]) == i[2]:
        print("Yes")
        exit()

print("No")

Solution (Python):

import sys, itertools 
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
sys.setrecursionlimit(10**8)
inf = float('inf')
ans = count = 0



a, b, c = map(int, input().split())
for i in itertools.permutations([a, b, c], 3):
    if i[0] == sum(i[1:]) or sum(i[:2]) == i[2]:
        print("Yes")
        exit()

print("No")

Solution (Python):

import sys, math, itertools
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
sys.setrecursionlimit(10**8)
inf = float('inf')
ans = count = 0



a, b, c = map(int, input().split())
for i in itertools.permutations([a, b, c], 3):
    if i[0] == sum(i[1:]) or sum(i[:2]) == i[2]:
        print("Yes")
        exit()

print("No")

Solution (Python):

import sys, math, itertools
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
sys.setrecursionlimit(10**8)
inf = float('inf')
ans = count = 0



a, b, c = map(int, input().split())
for i in itertools.permutations([a, b, c], 3):
    if i[0] == sum(i[1:]) or sum(i[:2]) == i[2]:
        print("Yes")
        exit()

print("No")

Solution (Python):

import sys, math, itertools, heapq
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
sys.setrecursionlimit(10**8)
inf = float('inf')
ans = count = 0



a, b, c = map(int, input().split())
for i in itertools.permutations([a, b, c], 3):
    if i[0] == sum(i[1:]) or sum(i[:2]) == i[2]:
        print("Yes")
        exit()

print("No")

Solution (Python):

import sys, math, itertools, heapq, collections
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
sys.setrecursionlimit(10**8)
inf = float('inf')
ans = count = 0



a, b, c = map(int, input().split())
for i in itertools.permutations([a, b, c], 3):
    if i[0] == sum(i[1:]) or sum(i[:2]) == i[2]:
        print("Yes")
        exit()

print("No")

Solution (Python):

import sys, math, itertools, heapq, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
sys.setrecursionlimit(10**8)
inf = float('inf')
ans = count = 0



a, b, c = map(int, input().split())
for i in itertools.permutations([a, b, c], 3):
    if i[0] == sum(i[1:]) or sum(i[:2]) == i[2]:
        print("Yes")
        exit()

print("No")

Solution (Python):

import sys, math, itertools, heapq, collections, bisect, fractions
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
sys.setrecursionlimit(10**8)
inf = float('inf')
ans = count = 0

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

for i in itertools.permutations([a,b,c],3):
    if i[0]==sum(i[1:]) or sum(i[:2])==i[2]:
        print("Yes")
        exit()

print("No")

Solution (Python):

import sys, math, itertools, heapq, collections, bisect, fractions
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
sys.setrecursionlimit(10**8)
inf = float('inf')
ans = count = 0

a,b,c=map(int,input().split())
for i in itertools.permutations([a,b,c],3):
    if i[0]==sum(i[1:]) or sum(i[:2])==i[2]:
        print("Yes")
        exit()

print("No")

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

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

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

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

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

if data[0]+data[1]==data[2] or data[0]+data[2]==data[1] or data[1]+data[2]==data[0]:
    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,b,c=[int(x) for x in input().split()]

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

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

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

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

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

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

Solution (Python):
a, b, c = map(int, input().split())
list = sorted([a, b, c])
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:
    print('Yes')
elif a+c ==b:
    print('Yes')
elif b+c ==a:
    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):
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())
s = a+b+c
m = max(a,b,c)
ans = 'No'
if m == s-m:
    ans = 'Yes'
print(ans)

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

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

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

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

Solution (Python):

import sys
input = sys.stdin.readline


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

ABC.sort()

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

Solution (Python):
def examA():
    abc = LI()
    abc.sort()
    if abc[0]+abc[1]==abc[2]:
        ans = "Yes"
    else:
        ans ="No"
    print(ans)


import sys
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def S(): return sys.stdin.readline().strip()
mod = 10**9 + 7
inf = float('inf')

examA()

Solution (Python):
import itertools


def solve():
    ABC = tuple(map(int, input().split()))
    

    permus = tuple(itertools.permutations((0, 1, 2), 3))
    for a, b, c in permus:
        if ABC[a] == ABC[b] + ABC[c]:
            return True
        if ABC[a] + ABC[b] == ABC[c]:
            return True

    return False


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

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

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

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

print('Yes' if max(l) * 2 == sum(l) else 'No')

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

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

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

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

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

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

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

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

Solution (Python):


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:
    ans = "Yes"
else:
    ans = "No"

print(ans)

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

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

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

Solution (Python):

a, b, c = [int(s) for s 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:
  ans = "Yes"
else:
  ans = "No"

print(ans)

Solution (Python):
A=list(map(int,input().split()))
print(("No","Yes")[max(A)==sum(A)-max(A)])

Solution (Python):

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

Solution (Python):
X = 2 
packs = [int(candies) for candies in input().split()]
N = int(len(packs))
if sum(packs) % X == 0:
    A = int(sum(packs) / X) 
else: 
    print('No')
    exit()
packSum = [sum([packs[x] for x in range(N) if i & (1 << x) != 0]) for i in range(1 << N)]
dp = [False] * (1 << N)
dp[0] = True 
for i in range(len(dp)): 
    if not dp[i]:
        continue
    for j in range(N): 
        if i & (1 << j) == 0: 
            dp[i | (1 << j)] = dp[i | (1 << j)] or packSum[i] // A == packSum[i | (1 << j)] // A or packSum[i] % A + packs[j] == A
            

if dp[-1]:
    ans = "Yes"
else:
    ans = "No"

print(ans)

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

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

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

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

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

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==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):
packs = [int(candies) for candies in input().split()]
N = int(len(packs))
X = 2
if sum(packs) % X == 0:
    A = int(sum(packs) / X) 
else: 
    print('No')
    exit()

dp = [[False] * (A + 1)] * (N + 1)
dp[0][0] = True

for i in range(N):
    for j in range(A+1):
        if dp[i][j]:
            dp[i+1][j] = dp[i][j]
        elif j >= packs[i]:
            dp[i+1][j] = dp[i][j - packs[i]]

if dp[N][A]:
    ans = "Yes"
else:
    ans = "No"

print(ans)

Solution (Python):


packs = [int(candies) for candies in input().split()]
N = int(len(packs))
if sum(packs) % 2 == 0:
    half = int(sum(packs) / 2)
else: 
    print('No')
    exit()

dp = [[False] * (half + 1)] * (N + 1)
dp[0][0] = True

for i in range(N):
    for j in range(half+1):
        if dp[i][j]:
            dp[i+1][j] = dp[i][j]
        elif j >= packs[i]:
            dp[i+1][j] = dp[i][j - packs[i]]

if dp[N][half]:
    ans = "Yes"
else:
    ans = "No"

print(ans)

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

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

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

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

sorted_n = sorted(n)


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

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

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

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()))
print('Yes' if sum(A) == max(A)*2 else 'No')

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

Solution (Python):
c = list(map(int, input().split()))
max_val = max(c); c.remove(max_val)
total_val = sum(c)
if max_val == total_val:
    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):
from sys import stdin
def main():
    a = list(map(int, input().split()))
    a.sort()
    if a[0] + a[1] == a[2]:
        print("Yes")
    else:
        print("No")

if __name__ == '__main__':
    main()

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

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

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

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