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

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

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

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

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

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

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

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

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

nums.sort()
print( "Yes" if nums[2]==nums[0]+nums[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):
l = list(map(int, input().split()))
l = sorted(l)
if l[0] + l[1] == l[2]:
    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):
a,b,c = (int(x) for x in input().split())

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

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

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

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

    if a + c == b:
        return 'Yes'

    if b + c == a:
        return 'Yes'

    return 'No'

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

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

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

l = list(map(int, input().split()))
l.sort()
if l[0]+l[1] == l[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):
def main():
    a, b, c = [int(v) for v in input().split()]

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


main()

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

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

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

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


if __name__ == '__main__':
    main()

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

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

Solution (Python):
def I(): return int(input())
def MI(): return map(int, input().split())
def LMI(): return list(map(int, input().split()))
MOD = 10 ** 9 + 7


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

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

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

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

if sum(total_list[:2]) == total_list[2]:
    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=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())
print("Yes" if a+b==c or a+c==b or b+c==a else "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())
n = (a+b+c)/2
if n == max(a, b, c):
    print("Yes")
else:
    print("No")

Solution (Python):

 
 
def main():

    
    num_candy = list(map(int,input().split(' ')))
    max_candy = max(num_candy)
 
    if sum(num_candy) / 2 == max_candy:
        print("Yes")
    else:
      print("No")
 
    return 0
 
 
if __name__ == '__main__':
    main()

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

b = max(a)

if sum(a) / 2 == b:
  print("Yes")
else:
  print("No")

Solution (Python):


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

if max(num) == sum(num)/2 :
  print('Yes')
else :
  print('No')

Solution (Python):
S,M,L=sorted(list(map(int,input().split())))
print('Yes' if S+M==L else "No")

Solution (Python):
import copy
a = list(map(int,input().split()))
nokori  = copy.copy(a)
count = max(a)
nokori.remove(count)
"""
if a[0] == a[1] == a[2]:
    print("No")
"""
if int(nokori[0] + nokori[1]) == count:
    print("Yes")
else:
    print("No")

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

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

print('YNeos'[A[0] + A[1] != A[2]::2])

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

print('YNeos'[A[0] + A[1] != A[2]::2])

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

Solution (Python):
list = input().split()
list = [int(n) for n in list]
list.sort(reverse=True)

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

else:
    print('No')

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

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

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

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

Solution (Python):

import sys
INF = float("inf")


def yes():
    print("Yes")  


def no():
    print("No")  


def solve(a: int, b: int, c: int):
    abc = sorted([a, b, c])
    if abc[0]+abc[1] == abc[2] or abc[0] == abc[1]+abc[2]:
        yes()
    else:
        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):
a, b, c = map(int, input().split())

sm = sum([a, b, c])

if sm/2 in set([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):
a,b,c=map(int,input().split())
flag=False
if (a+b)==c:
    flag=True
if (a+c)==b:
    flag=True
if (b+c)==a:
    flag=True
if flag:
    print("Yes")
else:
    print("No")

Solution (Python):


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

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

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

if a+b == c or 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):
l = list(map(int,input().split()))
print('YNeos'[sum(l)!=max(l)*2::2])

Solution (Python):
a,b,c = list(map(int,input().split()))
f = False
if a == b + c:
    f = True
elif b == a + c:
    f = True
elif 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+c==b or b+c==a 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):
lis = list(map(int, input().split()))
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 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=map(int,input().split())
print('Yes')if a+b+c == max(a,b,c)*2 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())
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 = list(map(int, input().split()))
m = [a, b, c]
maxvalue = 0
for i in range(len(m)):
    if m[i] > maxvalue:
        maxvalue = m[i]
if a + b + c - maxvalue == maxvalue:
    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 b + c == a or c + a == b else 'No')

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

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

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


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

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

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

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

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

Solution (Python):
a=list(map(int,input().split()))
a.sort()
if a[2]==a[0]+a[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):
def share_candies(a_candybag, b_candybag, c_candybag):

    sum_of_candy_list = [a_candybag, b_candybag, c_candybag]
    most_candies = sorted(sum_of_candy_list, reverse=True)[0]
    sum_of_candies = a_candybag + b_candybag + c_candybag
    if most_candies == sum_of_candies - most_candies:
        return 'Yes'
    else:
        return 'No'


if __name__ == '__main__':
    a, b, c = map(int, input().split())
    print(share_candies(a, b, c))

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):
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())
print("YNeos"[not(a+b+c==max(a,b,c)*2)::2])

Solution (Python):
"""
author : halo2halo
date : 2, Feb, 2020
"""

import sys
import itertools

import numpy as np

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

A= list(map(int, readline().split()))

print('Yes' if max(A) == sum(A)-max(A) else '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):
import sys
input = sys.stdin.readline
a,b,c = [int(i) for i in 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):
n = list(map(int,input().split()))
sl = sorted(n)
print("Yes" if sl[0]+sl[1]==sl[2] else "No")

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

Solution (Python):




def main():
    A, B, C = list(map(int, input().split()))
    print('Yes'if max([A, B, C]) == (
        sum([A, B, C]) - max([A, B, C])) 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())

all_ = a + b + c

if a == all_ - a or b == all_ - b or c == all_ - c:
    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 == 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())

candies = []
candies.append(a)
candies.append(b)
candies.append(c)

max_candy = max(candies)

candies.remove(max_candy)

if sum(candies) == max_candy:
    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 = 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 max(a, b, c) == a + b + c - max(a, b, c):
    print('Yes')
else:
    print('No')

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

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

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

max_candy = max(a, b, c)
else_candy = a + b + c - max_candy

if max_candy == else_candy:
    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
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 7)

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

Solution (Python):
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 7)

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

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

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

Solution (Python):
import math
a,b,c=map(int,input().split())
h=math.ceil((a+b+c)/2)
if h==a or h==b or h==c:
    print('Yes')
else:
    print('No')

Solution (Python):
import math
a,b,c=map(int,input().split())
s=a+b+c
h=math.ceil(s/2)
if s%2!=0:
    print('No')
elif h==a or h==b or h==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):
a, b, c = tuple(map(int, input().split()))

def judge():
    if a + b == c:
        return True
    elif b + c == a:
        return True
    elif a + c == b:
        return True
    else:
        return False


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

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

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

Solution (Python):
import sys
import numpy as np


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

candy = np.array([a, b, c])


candy.sort()


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

Solution (Python):
arr = input().split()
a = int(arr[0])
b = int(arr[1])
c = int(arr[2])

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

Solution (Python):
def main():
    from sys import stdin, setrecursionlimit
    
    
    r = stdin.readline()[:-1]
    
    
    
    
    
    a = list(map(int, r.split()))
    
    
    
    

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

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

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

check = False
for i in l:
  if (i == (sum(l) - i)):
    check = True
    break

result = 'Yes' if check else 'No'
print(result)

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

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

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

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

a=sorted(a)

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

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

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

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

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

if tmp[0] == sum(tmp[1:]) or tmp[2] == sum(tmp[:2]):
    print('Yes')
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())

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

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

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

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

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

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

avg = sum(li)//3
max_index = li.index(max(li))

ans = [x for x in li if x!=li[max_index] ]

if sum(ans)==li[max_index]:
    print('Yes')
else:
    print('No')

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

Solution (Python):
A = list(map(int,input().split()))
S = sum(A)//2

if S in A and sum(A)%2==0:
  print("Yes")
else:
  print("No")

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

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

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

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

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):
n = input().split()

n_i = [int(s) for s in n]

n_l = sorted(n_i)

if (n_l[0] + n_l[1] == n_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):
import sys


def solve(inp):
    A = list(map(int, inp.readline().strip().split(' ')))

    A = sorted(A)
    if A[0] + A[1] == A[2]:
        return "Yes"
    else:
        return "No"


def main():
    result = solve(sys.stdin)
    if result:
        print(result)


if __name__ == '__main__':
    main()

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

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

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

Solution (Python):



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

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

if candies[0]+candies[1] == candies[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):
    ans = 'Yes'
else:
    ans = 'No'
print(ans)

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

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

sum = a + b + c
large = max(a, b, c)

if sum == large * 2:
    print("Yes")

else:
    print("No")

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

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

Solution (Python):
import sys

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

Solution (Python):
a, b, c = map(lambda x: int(x), input().split())
lis = [a, b, c]
lis.sort()

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

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

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

Solution (Python):


import sys
input = sys.stdin.readline

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

tot = a + b + c

if (tot - a == a) | (tot - b == b) | (tot -c == c):
    print('Yes')
else:
    print('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 = list(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,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 = [int(i) for i in input().split()]
x.sort()

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

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

Solution (Python):

import sys


def main(argv=sys.argv):
  candy = list(map(int, input().split()))
  
  new_candy = sorted(candy)
  
  if new_candy[0] + new_candy[1] == new_candy[2]:
    print('Yes')
    
  else:
    print('No')

    
    
  return 0


if __name__ == '__main__':
  sys.exit(main())

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

al = sorted(al)

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

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

Solution (Python):

import sys
import numpy as np
import itertools


def main(argv=sys.argv):
  
    packs = list(map(int, input().split(' ')))
    packs = sorted(packs)
    if packs[2] - packs[1] - packs[0] == 0:
        print('Yes')
    else:
        print('No')
  
    return 0


if __name__ == '__main__':
    sys.exit(main())

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

result = "No"

av = (a + b + c) / 2

if av == a or av == b or av == c :
  result = "Yes"


print(result)

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

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

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

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