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.

	
	import java.io.BufferedOutputStream;
	import java.io.BufferedReader;
	import java.io.InputStreamReader;
	import java.io.PrintWriter;
	import java.util.*;

	
	public class e {
	
	public static class FastReader {
		BufferedReader br;
		StringTokenizer st;
		//it reads the data about the specified point and divide the data about it ,it is quite fast
		//than using direct 
	
		public FastReader() {
			br = new BufferedReader(new InputStreamReader(System.in));
		}
	
		String next() {
			while (st == null || !st.hasMoreTokens()) {
				try {
					st = new StringTokenizer(br.readLine());
				} catch (Exception r) {
					r.printStackTrace();
				}
			}
			return st.nextToken();
		}
	
		int nextInt() {
			return Integer.parseInt(next());//converts string to integer
		}
	
		double nextDouble() {
			return Double.parseDouble(next());
		}
	
		long nextLong() {
			return Long.parseLong(next());
		}
	
		String nextLine() {
			String str = "";
			try {
				str = br.readLine();
			} catch (Exception r) {
				r.printStackTrace();
			}
			return str;
		}
	}
	static ArrayList<String>list1=new ArrayList<String>();
	static void combine(String instr, StringBuffer outstr, int index,int k)
	{
		if(outstr.length()==k)
		{
			list1.add(outstr.toString());return;
		}
		if(outstr.toString().length()==0)
		outstr.append(instr.charAt(index));
	    for (int i = 0; i < instr.length(); i++)
	    {
	        outstr.append(instr.charAt(i));
	       
	        combine(instr, outstr, i + 1,k);
	        outstr.deleteCharAt(outstr.length() - 1);
	    }
	   index++;
	} 
	static ArrayList<ArrayList<Integer>>l=new ArrayList<>();
	static void comb(int n,int k,int ind,ArrayList<Integer>list)
	{
		if(k==0)
		{
			l.add(new ArrayList<>(list));
	
			return;
		}
		
		
		for(int i=ind;i<=n;i++)
		{
			list.add(i);
			comb(n,k-1,ind+1,list);
			
			list.remove(list.size()-1);
			
		}
		
		
		
		
		
	
	}
	
	static class Pair implements Comparable<Pair>{
	    int x;int y;
	    Pair(int x,int y){
	        this.x=x;
	        this.y=y;
	      //  this.i=i;
	    }
		@Override
		public int compareTo(Pair o) {
			// TODO Auto-generated method stub
			return (o.x*y-o.y*x);
			
		}
	}
	
		
	
	public static PrintWriter out = new PrintWriter (new BufferedOutputStream(System.out));
	  static HashMap<Long, Pair> sort(HashMap<Long, Pair> hm) 
	    { 
	        // Create a list from elements of HashMap 
	        List<Map.Entry<Long, Pair> > list = 
	               new LinkedList<Map.Entry<Long, Pair> >(hm.entrySet()); 
	  
	        // Sort the list 
	        Collections.sort(list, new Comparator<Map.Entry<Long, Pair> >() { 
	            public int compare(Map.Entry<Long, Pair> o1,  
	                               Map.Entry<Long, Pair> o2) 
	            { 
	                return (o1.getValue().y)-(o2.getValue().y); 
	            } 
	        }); 
	          
	        // put data from sorted list to hashmap  
	        HashMap<Long, Pair> temp = new LinkedHashMap<Long, Pair>(); 
	        for (Map.Entry<Long, Pair> aa : list) { 
	            temp.put(aa.getKey(), aa.getValue()); 
	        } 
	        return temp; 
	    } 
	  static long ncr(long n, int k) 
	    { long m=(long)1e9+7;
	        long C[] = new long[k + 1]; 
	         
	        // nC0 is 1 
	        C[0] = 1;   
	       
	        for (int i = 1; i <= n; i++) 
	        { 
	            // Compute next row of pascal  
	            // triangle using the previous row 
	            for (int j = Math.min(i, k); j > 0; j--) 
	                C[j] = (C[j]%m + C[j-1]%m)%m; 
	        } 
	        return C[k]%m; 
	    } 
	  static long high(long n) 
	  { 
	        
	      long p = (long)(Math.log(n) /  
	                    Math.log(2L)); 
	      return (long)Math.pow(2L, p);  
	  }
	  static int findd(int a){
	        if (parent[a]!=a){
	            parent[a] = findd(parent[a]);
	        }
	        return parent[a];
	    }
	 static int parent[];
	 static ArrayList<Integer>list=new ArrayList<Integer>();
	 static HashMap<Integer,Integer>map;
	 static boolean find(int n,int f)
	 {
		 if(map.containsKey(n))
		 {	
			 if(map.get(n)>=f)
			 {
				 map.put(n, map.get(n)-f);
				 if(map.get(n)==0)
					 map.remove(n);
				 return true;
			 }
			 else
			 {
				 f-=map.get(n);
				 map.remove(n);
				 if(find(n/2,2*f))
					 return true;
				 else
					 return false;
			 }
			
		 }
		 else if(n>1)
		 {
			if(find(n/2,2*f))
				return true;
			else
				return false;
		 }
		 else
			 return false;
	
	 }
	 
		public static void main(String[] args) {
			// TODO Auto-generated method stub
	
		FastReader in=new FastReader();
		ArrayList<String>list=new ArrayList<String>();
		TreeSet<Character>set=new TreeSet<Character>();
      HashMap<Integer,Integer>map=new HashMap<Integer,Integer>();
     
    	int n=4;
    	int a[]=new int[n];int sum=0;
    	for(int i=0;i<n;i++)
    	{
    		a[i]=in.nextInt();sum+=a[i];
    	}
      
    	Arrays.sort(a);
    	if(a[3]==sum-a[3])
    	{
    		out.println("YES");out.flush();return;
    	}
      for(int i=1;i<n;i++)
      {
    	  if((a[0]+a[i])==(sum-a[0]-a[i]))
    	  {
    		  out.println("YES");out.flush();return;
    	  }
      }
      out.println("NO");out.close();
      
		}
		
	}	
		
		
		
	
