#include<bits/stdc++.h>
using namespace std;

int a, b, c, d, minim, maxim;

int main(){
    cin >> a >> b >> c >> d;
    minim = min(min(min(a , b), c), d);
    maxim = max(max(max(a , b), c), d);
    if((minim + maxim == a + b + c + d - minim - maxim) || (maxim == a + b + c + d - maxim))
        cout << "Yes";
    else 
        cout << "No";
    return 0;
}

/**
 * Author: Daniel
 * Created Time: 2021-02-25 22:16:47
**/

#include <bits/stdc++.h>

using namespace std;

#define F first 
#define S second
#define ER erase
#define IS insert
#define PI acos(-1)
#define PB pop_back
#define EB emplace_back
#define lowbit(x) (x & -x)
#define SZ(x) ((int)x.size())
#define MP(x, y) make_pair(x, y)
#define ALL(x) x.begin(), x.end()
#define RALL(x) x.rbegin(), x.rend()
#define SOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);cout<<fixed<<setprecision(10)

typedef long long LL;
typedef vector<LL> VL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef unsigned long long ULL;

template <typename A> using VE = vector<A>;
template <typename A> using USET = unordered_set<A>;
template <typename A> using HEAP = priority_queue<A>;
template <typename A, typename B> using PA = pair<A, B>;
template <typename A, typename B> using UMAP = unordered_map<A, B>;
template <typename A> using RHEAP = priority_queue<A, vector<A>, greater<A> >;

///////////////////////////////////////////////////////////////////////////
//////////////////// DO NOT TOUCH BEFORE THIS LINE ////////////////////////
///////////////////////////////////////////////////////////////////////////

// check the limitation!!!
const int N = 100010, M = 1010;

int a[4];

// read the question carefully!!!
int main()
{
    SOS;

    int tot = 0;
    for (int i = 0; i < 4; i ++ ) 
    {
        cin >> a[i];
        tot += a[i];
    }
    sort(a, a + 4);
    do
    {
        int t = tot;
        int sum = 0;
        for (int i = 0; i < 4; i ++ )
        {
            sum += a[i];
            tot -= a[i];
            if (sum == tot)
            {
                cout << "Yes\n";
                return 0;
            }
        }
        tot = t;
    } while (next_permutation(a, a + 4));
    cout << "No\n";
    return 0;
}

// GOOD LUCK!!!
