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.*;
import java.math.BigInteger;
import java.util.*;
 
public class Solution {
    FastScanner in;
    PrintWriter out;
 
    class Item implements Comparable{
        int num;
        int count;
 
        public Item(int num, int count) {
            this.num = num;
            this.count = count;
        }
 
        public void increaseCount(){
            count++;
        }
 
        public int getCount() {
            return count;
        }
 
        public void setNum(int num) {
            this.num = num;
        }
 
        public int getNum() {
            return num;
        }
 
        @Override
        public int compareTo(Object o) {
            return count-((Item)o).count;
        }
    }
 
    void solve() {
       int arr[] = new int[4];
        int sum = 0, totalSum = 0;
        for (int i = 0; i < 4; i++) {
            arr[i] = in.nextInt();
            totalSum+=arr[i];
        }
 
        if (totalSum%2!=0)
            out.print("NO");
        else if (find(arr,totalSum/2,0)){
            out.print("YES");
        }else {
            out.print("NO");
        }
    }
 
    boolean find(int arr[], int sum, int currentIndex){
        if (currentIndex>=arr.length)
            return sum==0;
        if (sum==0)
            return true;
        boolean b1 = find(arr,sum-arr[currentIndex], currentIndex+1);
        boolean b2 = find(arr,sum, currentIndex+1);
        return b1 || b2;
    }
 
    void run() {
        try {
            in = new FastScanner(new File("Solution.in"));
            out = new PrintWriter(new File("Solution.out"));
 
            solve();
 
            out.close();
        } catch (FileNotFoundException e) {
            e.printStackTrace();
        }
    }
 
    void runIO() {
 
        in = new FastScanner(System.in);
        out = new PrintWriter(System.out);
 
        solve();
 
        out.close();
    }
 
    static void printArray(int arr[]){
        for (int i = 0; i < arr.length; i++) {
            System.out.print(arr[i]+", ");
        }
    }
 
    class FastScanner {
        BufferedReader br;
        StringTokenizer st;
 
        public FastScanner(File f) {
            try {
                br = new BufferedReader(new FileReader(f));
            } catch (FileNotFoundException e) {
                e.printStackTrace();
            }
        }
 
        public FastScanner(InputStream f) {
            br = new BufferedReader(new InputStreamReader(f));
        }
 
        String next() {
            while (st == null || !st.hasMoreTokens()) {
                String s = null;
                try {
                    s = br.readLine();
                } catch (IOException e) {
                    e.printStackTrace();
                }
                if (s == null)
                    return null;
                st = new StringTokenizer(s);
            }
            return st.nextToken();
        }
 
        boolean hasMoreTokens() {
            while (st == null || !st.hasMoreTokens()) {
                String s = null;
                try {
                    s = br.readLine();
                } catch (IOException e) {
                    e.printStackTrace();
                }
                if (s == null)
                    return false;
                st = new StringTokenizer(s);
            }
            return true;
        }
 
        int nextInt() {
            return Integer.parseInt(next());
        }
 
        long nextLong() {
            return Long.parseLong(next());
        }
 
        double nextDouble() {
            return Double.parseDouble(next());
        }
 
        int[] nextIntArray(int n){
            int returnArray[] = new int[n];
            for (int i = 0; i < n; i++) {
                returnArray[i] = this.nextInt();
            }
            return returnArray;
        }
 
        String[] nextStringArray(int n){
            String returnArray[] = new String[n];
            for (int i = 0; i < n; i++) {
                returnArray[i] = this.next();
            }  
            return returnArray;
        }
 
        char[] nextCharArray(int n){
            char returnArray[] = new char[n];
            for (int i = 0; i < n; i++) {
                returnArray[i] = this.next().charAt(0);
            }
            return returnArray;
        }
 
        long[] nextLongArray(int n){
            long returnArray[] = new long[n];
            for (int i = 0; i < n; i++) {
                returnArray[i] = this.nextLong();
            }
            return returnArray;
        }
    }
 
    public static void main(String[] args) {
        new Solution().runIO();
    }
}