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

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

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

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


if __name__ == "__main__":
    iroha()

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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())
list=[a,b,c]

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

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

Solution (Python):
import sys
sys.setrecursionlimit(250000)

def main():
    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")
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):
x = list(map(int,input().split()))
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:
    print('Yes')
elif b == a + c:
    print('Yes')
elif c == a + b:
    print('Yes')
else:
    print('No')

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

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

a.sort()

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

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

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

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

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

if __name__ == '__main__':
    main()

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

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

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

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


if __name__ == "__main__":
    solve()

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

Solution (Python):
def main():
    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__":
    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 = sorted(map(int, input().split()))
print("Yes" if sum(A[:2]) == A[2] else "No")

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

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

ans = "No"
if a + b == c:
  ans = "Yes"
if a + c == b:
  ans = "Yes"
if b + c == a:
  ans = "Yes"

print(ans)

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

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

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

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

Solution (Python):

a, b, c = 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')

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

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


def main():
    from itertools import product
    x = list(map(int, readline().split()))

    def judge():
        for bit in product(range(2), repeat=3):
            first = 0
            second = 0
            for i, b in enumerate(bit):
                if b:
                    first += x[i]
                else:
                    second += x[i]
            if first == second:
                return True
        return False

    if judge():
        print("Yes")
    else:
        print("No")


if __name__ == '__main__':
    main()

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

Solution (Python):
import sys
def input(): return sys.stdin.readline().strip()

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

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('NYoe s'[a+b==c or a+c==b or a==b+c::2])

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

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

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

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

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

result = 'No'

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

print(result)

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

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

print("Yes" if abc[0]+abc[1] == abc[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):





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

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

Solution (Python):













a, b, c = 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)

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]+abc[1]==abc[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 = map(int, input().split())

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

Solution (Python):

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


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

else:
    print('No')

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

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

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

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

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

Solution (Python):




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


if __name__ == "__main__":
    
    resolve()

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):
candy = sorted([int(x) for x in input().split()])
if candy[0] + candy[1] == candy[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):
str_line = input().split(" ")
num_line = [int(n) for n in str_line]
num_line.sort()


if (num_line[2] == num_line[1] + num_line[0]):
    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:
    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 = map(int, input().split())

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

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

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


if __name__ == '__main__':
    main()

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


if __name__ == '__main__':
    main()

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


if __name__ == '__main__':
    main()

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=input().split()
a=int(a)
b=int(b)
c=int(c)
ls=[a,b,c]
ls.sort()
if ls[0]+ls[1]==ls[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): 
    print('Yes')
elif b == (a + c):
    print('Yes')
elif 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 == (a + c) or c == (a+b) else 'No')

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

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

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

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

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

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

Solution (Python):

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

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

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

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

Solution (Python):













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







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


print(answer)

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

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

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

if s.pop(ma) == sum(s):
    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):
c = sorted(list(map(int, input().split())))

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

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

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

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

Solution (Python):
a,b,c= [int(i) for i in input().split()]
d = 0
if a+b==c:
  d+=1
elif a+c==b:
  d+=1
elif b+c==a:
  d+=1
if d==1:
  print("Yes")
else:
  print("No")

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

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

Solution (Python):
a,b,c= [int(i) for i in input().split()]
d = 0
if a+b==c:
  d+=1
elif a+c==b:
  d+=1
elif b+c==a:
  d+=1
if d==1:
  print("Yes")
else:
  print("No")

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

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

if org[0] == org[1] + org[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):
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 = (int(T) for T in input().split())
print(['No','Yes'][(a+b)==c or (b+c)==a or (c+a)==b])

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

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

Solution (Python):
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):
def main():
    A = list(map(int,input().split()))
    A.sort(reverse=True)
    if A[0] == A[1] + A[2]:
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    main()

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_box, b_box, c_box = map(int, input().split())

if a_box == b_box + c_box:
    print('Yes')
elif b_box == a_box + c_box:
    print('Yes')
elif c_box == a_box + b_box:
    print('Yes')
elif a_box == b_box == c_box and (a_box + b_box + c_box) % 2 == 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, 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:
    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 candy.count(sum(candy)/2) == 1:
  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 = sorted(map(int, input().split()))
print("Yes" if a+b == c else "No")

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

Solution (Python):
a,b,c=map(int,input().split())
s=a+b+c
if s%2==1:
  print("No")
  exit()
n=s//2
if n in [a,b,c]:
  print("Yes")
else:
  print("No")

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

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

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

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

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

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

Solution (Python):
packs = input()
new_packs = packs.split(" ")
a = int(new_packs[0])
b = int(new_packs[1])
c = int(new_packs[2])
if a + b == c or b + c == a or a + c == b:
  print("Yes")
else:
  print("No")

Solution (Python):
a = input()
b = a.split()
x = int(b[0])
y = int(b[1])
z = int(b[2])

if(x+y == z):
  print("Yes")
elif(x+z == y):
  print("Yes")
elif(y+z == x):
  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):
ame = sorted(list(map(int, input().split())))
if ame[0] + ame[1] == ame[2]:
    print('Yes')
else:
    print('No')

Solution (Python):
import bisect,collections,copy,heapq,itertools,math,string
import sys
def S(): return sys.stdin.readline().rstrip()
def M(): return map(int,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
l = LI()
l.sort(reverse=True)
if l[0] == l[1] + l[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):
n = sorted(list(map(int,input().split())))
print('Yes' if n[0]+n[1] == n[2] else 'No')

Solution (Python):

def main():
    abc = list(map(int, input().split()))


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

if __name__ ==  "__main__":
    main()

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

Solution (Python):
import sys

read = sys.stdin.read
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7


def main():
    a, b, c = map(int, readline().split())
    if a + b + c - max(a, b, c) == max(a, b, c):
        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):
L = [int(x) for x in 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())
if a+b==c or b+c==a or c+a==b:print('Yes')
else:print('No')

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

def main():
    n = map(int, input().split())
    n_sorted = sorted(n)
    if n_sorted[0] + n_sorted[1] == n_sorted[2]:
        print('Yes')
    else:
        print('No')


if __name__ == "__main__":
    main()

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

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

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

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

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

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

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

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

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

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

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

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

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

num_lists = [a, b, c]
maximum = a
if maximum < b: maximum = b
if maximum < c: maximum = c

max_index = num_lists.index(maximum)
num_lists.pop(max_index)

remainder = num_lists[0] + num_lists[1]
if maximum == remainder:
  ans = 'Yes'
else:
  ans = 'No'
  
print(ans)

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):
abc=sorted(list(map(int,input().split())))
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 = 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):
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 = map(int, input().split())
l = sorted(l, reverse=True)
if l[0] == sum(l[1:]):
    print('Yes')
else:
    print('No')