#include <bits/stdc++.h>

#define ll          long long int
#define pb          push_back
#define mp          make_pair
#define pii         pair<int,int>
#define vi          vector<int>
#define vii         vector<pair<int,int>>
#define mi          map<int,int>
#define all(a)      (a).begin(),(a).end()
#define F           first
#define S           second
#define sz(x)       (int)x.size()
#define endl        '\n'
#define rep(i,a,b)  for(i=a;i<b;i++)
#define inf         INT_MAX
#define llinf       LLONG_MAX

template<typename T, typename U> static inline void amin(T &x, U y){ if(y<x) x=y; }
template<typename T, typename U> static inline void amax(T &x, U y){ if(x<y) x=y; }

using namespace std;
void solve()
{
    int a[4],i;
    rep(i,0,4)cin>>a[i];
    sort(a,a+4);
    if(a[3]==a[0]+a[1]+a[2] || a[0]+a[2]==a[1]+a[3] || a[0]+a[3]==a[1]+a[2])cout<<"Yes";
    else cout<<"No";
}
int main()
{
    ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    //freopen("input.txt","r",stdin);
	//freopen("output.txt","w",stdout);
    int t=1;
    //cin>>t;
    while(t--)
    {
        solve();
    }
    return 0;
}

#include <bits/stdc++.h>

using namespace std;

#ifdef BOI
#include "debug.h"
#else
#define debug(args...)
#endif

using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
using pii = pair <int, int>;
using pli = pair <ll, int>;
using pll = pair <ll, ll>;

#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second

const ll INF = (ll)2e9 + 69;

int main() {
    ios_base :: sync_with_stdio(0);
    cin.tie(0);

    vector <ll> a(4); cin >> a[0] >> a[1] >> a[2] >> a[3];
    
    bool ok = false;
    for (int i = 0; i < 16; ++i) {
        ll sum = accumulate(all(a), 0);
        ll sum1 = 0;
        for (int j = 0; j < 4; ++j) {
            if (i & (1 << j)) sum1 += a[j];
        }
        sum -= sum1;
        if (sum == sum1) {
            ok = true;
            break;
        }
    }
    
    cout << (ok ? "Yes" : "No");
}