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

#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
#define all(x) x.begin(),x.end()
typedef long long ll;
ll mod = 1000000007;
ll inf = 1e18;
int main(){

    vector<int> a(4);
    rep(i,4) cin >> a[i];

    for(int bit=0; bit<(1<<4); bit++){
        int sum1=0;
        int sum2=0;
        rep(j,4){
            if(bit & (1<<j)) sum1+=a[j];
            else sum2+=a[j];
        }
        if(sum1==sum2){
            cout << "Yes" << endl;
            return 0;
        }
    }
    
    cout << "No" << endl;
    return 0;
}
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < n; ++i)
using ll = long long;
using P = pair<int,int>;
int main() {
   int a,b,c,d;cin>>a>>b>>c>>d;
   int sum=a+b+c+d;
   if(sum%2==1){
      cout<<"No"<<endl;
   }
   else{
      int half=sum/2;
      if(half==a||half==b||half==c||half==d)
         cout<<"Yes"<<endl;
      else if(half==a+b||half==a+c||half==a+d)
         cout<<"Yes"<<endl;
      else
         cout<<"No"<<endl;
   }
}