#include<bits/stdc++.h>
#define rep(i,n) for(int (i)=0;(i) < (n);(i)++)
#define repsec(i,m,n) for(int (i)=(m);(i) < (n);(i)++)
#define ll long long
#define mod 998244353
#define MOD 1000000007

using namespace std;

int main(){
  ll a[4];
  cin >> a[0] >> a[1] >> a[2] >> a[3];
  ll S = a[0] + a[1] + a[2] + a[3];

  bool flag = false;

  for(int mask=0;mask < 16;mask++){
    ll sum = 0;
    for(int i=0;i < 4;i++){
      if((mask >> i)&1) sum += a[i];
    }
    if(S-sum == sum) flag = true;
  }
  if(flag) cout << "Yes" << endl;
  else cout << "No" << endl;
  return 0;
}
#include <iostream>
using namespace std;

int main() {
  long long A, B, C, D;
  cin >> A >> B >> C >> D;
  long long N = A + B + C + D;
  if (2 * A == N){
    cout << "Yes" << endl;
  }
  else if (2 * B == N){
    cout << "Yes" << endl;
  }
  else if (2 * C == N){
    cout << "Yes" << endl;
  }
  else if (2 * D == N){
    cout << "Yes" << endl;
  }
  else if (2 * (A + B) == N){
    cout << "Yes" << endl;
  }
  else if (2 * (A + C) == N){
    cout << "Yes" << endl;
  }
  else if (2 * (A + D) == N){
    cout << "Yes" << endl;
  }
  else cout << "No" << endl;
}