#include <algorithm>
#include <iostream>
using ll = long long;
using namespace std;

int main() {
  int a[4];
  for (int i = 0; i < 4; i++) cin >> a[i];
  sort(a, a + 4);
  if (a[0] + a[3] == a[1] + a[2] || a[0] + a[1] + a[2] == a[3])
    cout << "Yes" << endl;
  else
    cout << "No" << endl;
  return 0;
}



#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define f(i,a,n) for(ll i=a;i<n;i++)
#define w(x) ll _t;cin>>_t;f(x,1,_t+1)
#define br cout<<"\n"
#define N 400001
ll md=1e9+7;

bool fun(ll a[],ll i,ll small,ll sm){
    if(i==4){
        return (small-sm)==sm;
    }
    return fun(a,i+1,small,sm+a[i]) || fun(a,i+1,small,sm);
}

int main() {
    ios::sync_with_stdio(false);cin.tie(0);
    char x[]={'A','B','C'};
    //w(_x)
    {
        ll a[4];
        f(i,0,4) cin>>a[i];
        ll small=0;f(i,0,4) small+=a[i];
        if(fun(a,0,small,0)) cout<<"Yes";
        else
        cout<<"No";
    }
    return 0;
}