#include <iostream>
using namespace std;

int main(){
  double  a,b,c,d;

  cin>>a>>b>>c>>d;

if(a+b==c+d){
cout<<"Yes"<<endl;
}
else if(a+c==b+d){
cout<<"Yes"<<endl;
}
else if(a+d==b+c){
  cout<<"Yes"<<endl;
}
else if(a+b+c==d)
cout<<"Yes"<<endl;
else if(b+d+c==a)
cout<<"Yes"<<endl;
else if(c==a+b+d)
cout<<"Yes"<<endl;
else if(b==a+c+d)
cout<<"Yes"<<endl;
else {
  cout<<"No"<<endl;
}
}
#include <bits/stdc++.h>

#define F first
#define S second
#define MP make_pair
#define pb push_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define LCM(a, b) (a) / __gcd((a), (b)) * (b)
#define CEIL(a, b) (a)/(b)+(((a)%(b))?1:0)
#define log_2(a) (log((a)) / log(2))
#define ln '\n'

using namespace std;
using LL = long long;
using ldouble = long double;
using P = pair<int, int>;
using LP = pair<LL, LL>;

static const int INF = INT_MAX;
static const LL LINF = LLONG_MAX;
static const int MIN = INT_MIN;
static const LL LMIN = LLONG_MIN;
static const int MOD = 1e9 + 7;
static const int SIZE = 200005;

const int dx[] = {0, -1, 1, 0};
const int dy[] = {-1, 0, 0, 1};

vector<LL> Div(LL n) {
    vector<LL> ret;
    for(LL i = 1; i * i <= n; ++i) {
        if(n % i == 0) {
            ret.pb(i);
            if(i * i != n) ret.pb(n / i);
        }
    }
    sort(all(ret));
    return ret;
}

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

    int a[4];
    for(int i = 0; i < 4; ++i) cin >> a[i];
    for(int i = 1; i < 16; ++i) {
        int s = 0, t = 0;
        for(int j = 0; j < 4; ++j) {
            if((i >> j) & 1) s += a[j];
            else t += a[j];
        }
        if(s == t) {
            cout << "Yes" << endl;
            return 0;
        }
    }
    cout << "No" << endl;
    return 0;
}

