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.
# Dynamic Programming based python 
# program to partition problem 

# Returns true if arr[] can be 
# partitioned in two subsets of 
# equal sum, otherwise false 
def findPartition(arr, n): 
	sum = 0
	i, j = 0, 0
	
	# calculate sum of all elements 
	for i in range(n): 
		sum += arr[i] 
	
	if sum % 2 != 0: 
		return False 
	
	part = [[ True for i in range(n + 1)] 
				for j in range(sum // 2 + 1)] 
	
	# initialize top row as true 
	for i in range(0, n + 1): 
		part[0][i] = True
		
	# intialize leftmost column, 
	# except part[0][0], as 0 
	for i in range(1, sum // 2 + 1): 
		part[i][0] = False
	
	# fill the partition table in 
	# bottom up manner 
	for i in range(1, sum // 2 + 1): 
		
		for j in range(1, n + 1): 
			part[i][j] = part[i][j - 1] 
			
			if i >= arr[j - 1]: 
				part[i][j] = (part[i][j] or
							part[i - arr[j - 1]][j - 1]) 
		
	return part[sum // 2][n] 
	


arr = [] 
arr = list(map(int,input().split()))
if findPartition(arr, len(arr)) == True: 
	print ("Yes") 
else: 
	print ("No") 

