#include<bits/stdc++.h>
#define ll long long int
#define mod 1000000007
using namespace std;

void solve() {
    ll arr[4];
    ll sum = 0;
    // ll one;
    for(int i=0; i<4; i++){
        cin>>arr[i]; 
        sum+=arr[i];
    }
    //Two
    sort(arr, arr+4);
    ll one = arr[3];
    sum-=arr[3];
    if(one < sum){
        if(one + arr[0] == sum-arr[0]){
            cout<<"Yes"<<endl;
            return;
        }
        else if(one + arr[1] == sum - arr[1]){
            cout<<"Yes"<<endl;
        }
        else if(one + arr[2] == sum-arr[2]){
            cout<<"Yes"<<endl;
        }
        else{
            cout<<"No"<<endl;
        }
    }
    else if(one == sum){
        cout<<"Yes"<<endl;
        return;
    }
    else{
        cout<<"No"<<endl;
        return;
    }
    return;
}


int main(){
    #ifndef ONLINE_JUDGE
    freopen("/home/shubham/Desktop/codes/input.txt", "r", stdin);
    freopen("/home/shubham/Desktop/codes/output.txt", "w", stdout);
    #endif
    ios_base::sync_with_stdio(false); 
    cin.tie(NULL);    
    ll t;
    // cin>>t;
    t = 1;
    while(t--) {
        solve();
    }
    return 0;
}
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define printVec(v) printf("{"); for (const auto& i : v) { std::cout << i << ", "; } printf("}\n");
#define ALL(obj) (obj).begin(), (obj).end()
#define debug(x) cout << #x << ": " << x << '\n';
#define degreeToRadian(deg) (((deg)/360)*2*M_PI)
#define radianTodegree(rad) (((rad)/2/M_PI)*360)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
using namespace std;
using P = pair<int,int>;
using ll = long long;
const ll INF = 1LL<<60;
const int MOD = 1e9 + 7;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};

//cin.tie(0);ios::sync_with_stdio(false);
//cout << fixed << setprecision(15) << y << endl;
int main() {
  int A, B, C, D;
  cin >> A >> B >> C >> D;
  vector<int> T;
  T.push_back(A);
  T.push_back(B);
  T.push_back(C);
  T.push_back(D);

  bool ok = false;
  for (int bit = 1; bit < (1 << 4); bit++) {
    ll sum = A + B + C + D;
    ll x = 0;
    for (int i = 0; i < 4; i++) {
      if (bit & 1 << i) {
	sum -= T[i];
	x += T[i];
      }
    }
    if (sum == x) ok = true;
  }

  if (ok) {
    cout << "Yes" << endl;
  } else {
    cout  << "No" << endl;
  }
  return 0;
}
