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-----
10 30 20

-----Sample Output-----
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.

Difficulty: introductory

Starter code:

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


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

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

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

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


a = list(map(int,input().split()))
b = a.pop(a.index(max(a)))
if b == sum(a):
  print("Yes")
else:
  print("No")

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

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

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

# A+B=C か　A+C=B か B+C=Aになるか判定

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

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

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

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

#47
data=list(input().split())
if (int(data[0])>int(data[1]) and int(data[0])>int(data[2])):
    if int(data[0])==int(data[1])+int(data[2]):
        print('Yes')
    else:
        print('No')
elif (int(data[1])>int(data[0]) and int(data[1])>int(data[2])):
    if int(data[1])==int(data[0])+int(data[2]):
        print('Yes')
    else:
        print('No')
elif (int(data[2])>int(data[1]) and int(data[2])>int(data[0])):
    if int(data[2])==int(data[1])+int(data[0]):
        print('Yes')
    else:
        print('No')
else:
    print('No')

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

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

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

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

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

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

result = 'No'

if a + b == c or a + c == b or a == b + c:
    result = 'Yes'

print(result)


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

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

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

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

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

S_max = max(S_list)
answer = (sum(S_list)) / S_max
if answer == 2:
    result = "Yes"
else:
    result = "No"
print(result)

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

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

# 3個のパックにそれぞれ、a,b,c個のキャンディーが入っている
# キャンディーを2人に分ける際、個数が等しくなるか判定

# 入力
a, b, c = list(map(int, input().split()))

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


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

def main():
    t = list(map(int, input().split()))
    if sum(t[0:2]) == t[2] or sum(t[1:]) == t[0] or sum(t[::2]) == t[1]:
        print('Yes')
    else:
        print('No')

def __starting_point():
    main()
__starting_point()

abc = list(map(int,input().split()))
abc.sort()

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

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

# 競プロ幼稚園に通う 2人の子供がキャンディーの取り合いをしています。
# 3個のキャンディーパックがあり、
# それぞれのパックにはキャンディーが a, b, c個入っています。
# えび先生はこの 3個のパックを、
# キャンディーの個数が等しくなるように 2人に分けようとしています。
# そのような分け方が可能かどうかを判定してください。
# ただし、キャンディーをパックから取り出すことはできず、
# それぞれのパックをそのままどちらかの子供にあげる必要があります。

# 制約
# 1 ≦ a, b, c ≦ 100

# 標準入力から、a, b, c の値を取得する
a, b, c = list(map(int,input().split()))

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

print(result)


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

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

if m == (s - m):
  print("Yes")
else:
  print("No")

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

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

l = list(map(int,input().split()))
l1 = sorted(l, reverse = True)
s = sum(l1)
if l1[0] == s/2:
    print("Yes")
else:
    print("No")

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

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

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


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

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

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

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

A,B,C = map(int,input().split())

if A == B + C or B == A + C or C == A + B:
    print('Yes')
else:
    print('No')

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


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

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


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

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

# 入力
a, b, c = list(map(int, input().split()))

# 2等分できるならYes、できないならNo
if a + b == c:
    print('Yes')
elif a + c == b:
    print('Yes')
elif b + c == a:
    print('Yes')
else:
    print('No')


abc = list(map(int, input().split()))
abc_max = max(abc)
abc2 = abc
abc2.remove(abc_max)

if abc_max == sum(abc2):
    print('Yes')
else:
    print('No')

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

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

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

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


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

# 入力
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')


# 出力



# A - キャンディーと2人の子供

# それぞれ数個ずつキャンディーの入ったパックが3個ある
# 二人の子供に、キャンディーを等しい数ずつ分けられるか判定する


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


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

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

A, B, C = [int(i) for i in input().split()]
x = max(A, B, C)
s = sum([A, B, C])
y = s - x

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


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

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

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

else:
    print('No')

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

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


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


def __starting_point():
    iroha()


__starting_point()

#
# abc047 a
#

import sys
from io import StringIO
import unittest


class TestClass(unittest.TestCase):
    def assertIO(self, input, output):
        stdout, stdin = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(input)
        resolve()
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, stdin
        self.assertEqual(out, output)

    def test_入力例_1(self):
        input = """10 30 20"""
        output = """Yes"""
        self.assertIO(input, output)

    def test_入力例_2(self):
        input = """30 30 100"""
        output = """No"""
        self.assertIO(input, output)

    def test_入力例_3(self):
        input = """56 25 31"""
        output = """Yes"""
        self.assertIO(input, output)


def resolve():
    C = list(map(int, input().split()))
    C.sort()

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


def __starting_point():
    # unittest.main()
    resolve()

__starting_point()

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

# 047_a
a, b, c = list(map(int, input().split()))
if (1 <= a <= 100) & (1 <= b <= 100) & (1 <= c <= 100):
    if (a + b == c) | (a == b + c) | (a + c == b):
        print('Yes')
    else:
        print('No')


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

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

l=list(map(int,input().split()))
print("Yes")if(e:=sum(l))%2==0 and e//2 in l else print("No")

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

import sys, math
from itertools import combinations as c, product as p
from collections import deque
sys.setrecursionlimit(10**9)


def si(): return input()
def ii(): return int(input())
def fi(): return float(input())
def lint(): return list(map(int, input().split()))
def lint_dec(): return list([int(x) - 1 for x in input().split()])
def lnstr(n): return [input() for _ in range(n)]
def lnint(n): return [int(input()) for _ in range(n)]
def lint_list(n): return [lint() for _ in range(n)]



############################################################
a, b, c = sorted(lint())
print(('Yes' if a + b == c else 'No'))


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

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

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

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

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

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

a, b, c = list(map(int, input().split()))
s = (a + b + c) / 2
if s == a or s == b or s == c:
    print('Yes')
else:
    print('No')

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

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

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

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

a, b, c = list(map(int, input().split()))
ma = max(a, b, c)
rem = a + b + c - ma
if ma == rem:
    print('Yes')
else:
    print('No')


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

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


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

candy = sorted([int(x) for x in input().split()])
if candy[0] + candy[1] == candy[2]:
    print('Yes')
else:
    print('No')

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

# 入力
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')

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

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


def __starting_point():
    solve()
__starting_point()

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

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


# 競プロ幼稚園に通う2人の子供がキャンディーの取り合いをしています。
# 3個のキャンディーパックがあり、それぞれのパックにはキャンディーがa,b,c個入っています。
# えび先生はこの3個のパックを、キャンディーの個数が等しくなるように2人に分けようとしています。そのような分け方が可能かどうかを判定してください。
# ただし、キャンディーをパックから取り出すことはできず、それぞれのパックをそのままどちらかの子供にあげる必要があります。

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

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

else:
    print('No')

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

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

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

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

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

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

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

a,b,c=map(int,input().split())
print('NYoe s'[a+b==c or a+c==b or a==b+c::2])

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

li = sorted([a, b, c])
ans = 'No'
if sum(li[:2])==li[2]:
    ans ='Yes'
print(ans)

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

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


import sys
sys.setrecursionlimit(250000)

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



#
# while True:
#     pair_str = input().split()
#     pair_int = [int(s) for s in pair_str]
#     if pair_int[0] == 0 and pair_int[1] == 0 :
#         break
#     else:
#         input_list.append(pair_int)


# if b > c * 2 :
    #     b_price = c
    #
    # input_array_list = []
    #
    # while True:
    #     input_array = input().split()
    #     if input_array[0] == "0" and input_array[1] == "0":
    #         break
    #     else:
    #         input_array_list.append(input_array)
    #
    # for item in input_array_list:
    #     n = int(item[0])
    #     k_sum = int(item[1])
    #
    #     count = 0
    #     for i in range(1,n + 1- 2):
    #         for j in range(i+1, n + 1 - 1):
    #             for k in range (j+1, n+ 1):
    #                 if i + j + k == k_sum :
    #                     count = count + 1
    #     print(count)

    #
    # for item in input_array_list:
    #     if item[1] == "+":
    #         print(str(int(item[0])+int(item[2])))
    #     elif item[1] =="-":
    #         print(str(int(item[0])-int(item[2])))
    #     elif item[1] == "/":
    #         print(str(int(item[0])//int(item[2])))
    #     elif item[1] == "*":
    #         print(str(int(item[0])*int(item[2])))
    #

# import sympy as sp

# input_list = []
# a,b,c = map(int, input().split())
# divisors = sp.divisors(c)
#
# count = 0
#
# for divisor in divisors:
#     if a <= divisor and divisor <= b:
#         count = count + 1
# print(count)
#
# while True:
#     pair_str = input().split()
#     pair_int = [int(s) for s in pair_str]
#     if pair_int[0] == 0 and pair_int[1] == 0 :
#         break
#     else:
#         input_list.append(pair_int)
#
# for pair_int in input_list:
#     if pair_int[0] <= pair_int[1]:
#         print("{} {}".format(pair_int[0], pair_int[1]))
#     else:
#         print("{} {}".format(pair_int[1], pair_int[0]))

#for i in range(10000):
#    print("Hello World")
#a = input().split()
#a_int = [int(s) for s in a]
#a_sorted = sorted(a_int)
#print(' '.join(map(str, a_sorted)))


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

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


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

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

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

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

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

str_line = input().split(" ")
num_line = [int(n) for n in str_line]
num_line.sort()
#print(num_line)

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

# キャンディの個数を取得
a,b,c = map(int,input().split())

#判定結果をもとにメッセージを出力
if a == b + c\
or b == a + c\
or c == a + b:
  print("Yes")
else:
  print("No")

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

# 047a

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



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

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