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=list(map(int,input().split()));print("YNeos"[sum(a)!=max(a)*2::2])

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

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

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

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

Solution (Python):
arr = list(map(int, input().split()))
ans = "Yes" if sum(arr) - max(arr) == max(arr) else "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, b, c = map(int, input().split())

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

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

max = 0
sum = 0

for i in range(3):

    if i == 0:
        max = int(candy[i])
    else:
        if int(candy[i]) > max:
            sum = sum + max
            max = int(candy[i])
        else:
            sum = sum + int(candy[i])


if max == sum:
    print("Yes")
else:
    print("No")

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

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

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

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

Solution (Python):
C = list(map(int, input().split()))
m = max(C)
s = sum(C) - m
print(['No', 'Yes'][m == s])

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

Solution (Python):


def solve(a, b, c):
    X = [a, b, c]
    flag = False
    
    for i in range(1<<3):
        A = B = 0
        for j in range(3):
            if((i>>j)&1):
                A += X[j]
            else:
                B += X[j]
        if(A == B):
            flag = True
                
    print("Yes" if flag else "No")
    
if __name__ == '__main__':
    a, b, c = map(int, input().split())
    
    solve(a, b, c)

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

Solution (Python):


def read_input():
    a, b, c = map(int, input().split())
    return a, b, c

def submit():
    a, b, c = read_input()

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

    if candies[0] == sum(candies[1:]):
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    submit()

Solution (Python):
a, b, c = map(int, input().split())
candy = [a, b, c]
candy.sort()
if candy[-1] == candy[0] + candy[1]:
    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):
abc = [int(i) for i in input().split()]

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

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

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

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

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

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

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

if sum(a[0:2]) == a[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 :
    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 functools

import os
import sys

sys.setrecursionlimit(10000)
INF = float('inf')


def inp():
    return int(input())


def inpf():
    return float(input())


def inps():
    return input()


def inl():
    return list(map(int, input().split()))


def inlf():
    return list(map(float, input().split()))


def inls():
    return input().split()


def inpm(line):
    return [inp() for _ in range(line)]


def inpfm(line):
    return [inpf() for _ in range(line)]


def inpsm(line):
    return [inps() for _ in range(line)]


def inlm(line):
    return [inl() for _ in range(line)]


def inlfm(line):
    return [inlf() for _ in range(line)]


def inlsm(line):
    return [inls() for _ in range(line)]


def Yesif(cond):
    print('Yes' if cond else 'No')


def YESIF(cond):
    print('YES' if cond else 'NO')


def yesif(cond):
    print('yes' if cond else 'no')


a, b, c = sorted(inl())
Yesif((a + b == c) )

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):
from functools import reduce
from operator import add

A = list(map(int, input().split()))
M = max(A)
T = [i for i in A if i != M]
if len(T) == 0:
    print("No")
else:
    print("Yes" if M==reduce(add, T) else "No")

Solution (Python):

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

Solution (Python):
import sys

def main():
    input = sys.stdin.readline
    A = list(map(int, input().split()))
    A = sorted(A)

    if A[0] + A[1] == A[2]:
        return 'Yes'
    else:
        return 'No'


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

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

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

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

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

Solution (Python):
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())
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 a[0] + a[1] == a[2]:
    print("Yes")
else:
    print("No")

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

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

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

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

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

Solution (Python):


t = [int(i) for i in input().split()]
t.sort()

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

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

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

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

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

Solution (Python):
A = list(map(int, input().split()))
x = sorted(A)
if x[0] + x[1] == x[2]:
  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):
from sys import stdin

A, B, C = [int(x) for x in stdin.readline().rstrip().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):
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())

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

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

else:
    print("No")

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

Solution (Python):
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 = (int(x) for x in input().split())
candy = [a, b, c]

candy.sort()

max_candy = candy[2]
middle_candy = candy[1]
min_candy = candy[0]

if max_candy == middle_candy + min_candy:
    print('Yes')
else:
    print('No')

Solution (Python):
def fighting_over_candies(a: int, b: int, c: int)->bool:
    return (a + b) == c or (b + c) == a or (c + a) == b


if __name__ == "__main__":
    a, b, c = map(int, input().split())
    yes = fighting_over_candies(a, b, c)
    print('Yes' if yes else 'No')

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits

def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7

a, b, c = MAP()

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

Solution (Python):
a, b, c = map(int, input().split())
ab = a+b
bc = b+c
ca = c+a
flg = False
if ab == c:
    flg = True
if bc == a:
    flg = True
if ca == b:
    flg = True

if flg == True:
    print("Yes")
else:
    print("No")

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

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

abc = sorted(abc)

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

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

x.sort()

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

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

Solution (Python):
import collections
from functools import reduce

def main():
    
    

    
    

    
    
    
    
    

    
    
    
    
    
    X = [int(_) for _ in input().split()]
    if X[0] + X[1] == X[2] or X[0] + X[2] == X[1] or X[1] + X[2] == X[0]:
        print('Yes')
    else:
        print('No')

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

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

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

Solution (Python):

from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = I()
    return l
def LIR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = LI()
    return l
def SR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = S()
    return l
def LSR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = LS()
    return l
sys.setrecursionlimit(1000000)
mod = 1000000007


def A():
    s = LI()
    if sum(s) ==  2*max(s):
        print("Yes")
    else:
        print("No")
    return


def B():
    return


def C():
    return


def D():
    return


def E():
    return


def F():
    return


def G():
    return


def H():
    return


if __name__ == "__main__":
    A()

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

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

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

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

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

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

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

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

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

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

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


if __name__ == "__main__":
    main()

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

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

Solution (Python):

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

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

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

Solution (Python):
from itertools import combinations, product


def gcd(a, b):
    if a < b:
        a, b = b, a
    while b != 0:
        a, b = b, a % b
    return a

def lcm(a, b):
    return a * b // gcd(a, b)


def get(fmt):
    ps = input().split()
    r = []
    for p, t in zip(ps, fmt):
        if t == "i":
            r.append(int(p))
        if t == "f":
            r.append(float(p))
        if t == "s":
            r.append(p)
    if len(r) == 1:
        r = r[0]
    return r

def put(*args, **kwargs):
    print(*args, **kwargs)


def rep(n, f, *args, **kwargs):
    return [f(*args, **kwargs) for _ in range(n)]
    
def rep_im(n, v):
    return rep(n, lambda: v)
    
YES_NO = ["NO", "YES"]

val = sorted(get("iii"))

if val[0] + val[1] == val[2]:
    put("Yes")
else:
    put("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 + c == a:
    print('Yes')
elif a + c == b:
    print('Yes')
else:
    print('No')

Solution (Python):
a, b, c = list(map(int, input().split()))
total = a + b + c
n = max(a, b, c)

if total-n == n:
    print('Yes')
else:
    print('No')

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

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

Solution (Python):

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

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

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

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

a.sort()

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

Solution (Python):
v = list(map(int, input().split()))
v = sorted(v)
if v[0]+v[1] == v[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):
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):
candies = list(map(int, input().split()))
flag = "No"
for i in range(3):
    for j in range(3):
        k = list({0,1,2} - {i, j})[0]
        if candies[i] + candies[j] == candies[k]:
            flag = "Yes"

print(flag)

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

Solution (Python):
A, B, C = [int(_) for _ in input().split()]

xs = sorted([A, B, C])

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

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

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

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

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

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

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

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

a, b, c = map(int, input().split())
total = a + b + c
maxNum = max(a, max(b, c))
print("Yes") if maxNum == (total - maxNum) else print("No")

Solution (Python):
a, b, c = map(int, input().split())
candy_nums = sorted([a, b, c])
print('Yes' if candy_nums[0] + candy_nums[1] == candy_nums[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 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):
import sys
ABC = [int(n) for n in input().split()]





sumABC = sum(ABC)
for i in range(0,3):
    if(sumABC - ABC[i] == ABC[i]):
        print("Yes")
        sys.exit()
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=input();print('NYoe s'[' 2'in s or' 5'in s::2])

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

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

Solution (Python):
a = input().split()
for i in range(3):
  a[i] = int(a[i])
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):

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

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

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


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

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

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

Solution (Python):
lst = sorted([int(x) for x in input().split()])
if lst[0] + lst[1] == lst[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=sorted(list(map(int,input().split())))
print("YNeos"[A[0]+A[1]!=A[2]::2])

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

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

Solution (Python):
s = [int(i) for i in input().split()]
if max(s)*2 == sum(s):
  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())
c1=a==b+c
c2=b==a+c
c3=c==a+b
print("Yes" if c1 or c2 or c3 else "No")

Solution (Python):

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

if ans[0] + ans[1] == ans[2]:
    ans = 'Yes'
else:
    ans = 'No'

print(ans)

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

m = max(max(a, b), c)
s = a + b + c
ans = m * 2 == s

print("Yes" if ans else "No")
print()

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

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

Solution (Python):
C=sorted(map(int,raw_input().split()))
print["No","Yes"][C[2]==C[0]+C[1]]

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