Dawid has four bags of candies. The i-th of them contains a_i candies. Also, Dawid has two friends. He wants to give each bag to one of his two friends. Is it possible to distribute the bags in such a way that each friend receives the same amount of candies in total?

Note, that you can't keep bags for yourself or throw them away, each bag should be given to one of the friends.

Input

The only line contains four integers a_1, a_2, a_3 and a_4 (1 ≤ a_i ≤ 100) — the numbers of candies in each bag.

Output

Output YES if it's possible to give the bags to Dawid's friends so that both friends receive the same amount of candies, or NO otherwise. Each character can be printed in any case (either uppercase or lowercase).

Examples

Input


1 7 11 5


Output


YES


Input


7 3 2 5


Output


NO

Note

In the first sample test, Dawid can give the first and the third bag to the first friend, and the second and the fourth bag to the second friend. This way, each friend will receive 12 candies.

In the second sample test, it's impossible to distribute the bags.
'''input
1 7 11 5
'''
from collections import defaultdict as dd
from collections import Counter as ccd
from itertools import  permutations as pp
from itertools import combinations as cc
from random import randint as rd
from bisect import bisect_left as bl
from bisect import bisect_right as br
import heapq as hq
from math import gcd
'''
Author : dhanyaabhirami
Hardwork beats talent if talent doesn't work hard
'''
'''
Stuck?
See github resources
Derive Formula
Kmcode blog
CP Algorithms Emaxx
'''
mod=pow(10,9) +7
def inp(flag=0):
    if flag==0:
        return list(map(int,input().strip().split(' ')))
    else:
        return int(input())

# Code credits
# assert(debug()==true)
# for _ in range(int(input())):

# n,k=inp()
# s=list(input().strip())
# i=0
# while i<n and k>0:
#     if i==0:
#         if n==1:
#             s[i]='0'
#         elif s[i]!='1':
#             s[i]='1'
#             k-=1
#     elif s[i]!=0:
#         s[i]='0'
#         k-=1
#     i+=1
# print("".join(s))
def canPartition( nums):
    if len(nums) < 2: return False
    
    total = sum(nums)
    if total & 1: return False
    
    target, memo = total//2, {}
    return dfs(tuple(nums),target,memo)

def dfs( nums,target,memo):
    if not nums: return False
    
    if nums in memo: 
        return memo[nums]
    
    s = sum(nums)
    if s == target: 
        memo[nums] = True
        return True
    
    if s < target: 
        memo[nums] = False
        return False
    
    for i in range(len(nums)):
        _nums = list(nums)
        n = _nums.pop(i)
        if dfs(tuple(_nums),target,memo):
            memo[nums] = True
            return True
        
    memo[nums] = False
    return False
l= inp()
if canPartition(l):
    print("YES")
else:
    print("NO")

