///Bismillahir Rahmanir Rahim
#include<bits/stdc++.h>
#define        u64             uint64_t
#define        ll              long long
#define        endl            "\n"
#define        PI              acos(-1)
#define        fi              first
#define        si              second
#define        mkp             make_pair
#define        pb              push_back
#define        set0(arr)       memset(arr, 0, sizeof(arr))
#define        setinf(arr)     memset(arr, 126, sizeof(arr))
#define        all(x)          (x).begin(),(x).end()
#define        sz(v)           ((int)(v).size())
#define        IOS             ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
using namespace std;
using          pll        =      pair<ll, ll> ;
using          vl         =      vector<ll> ;
using          vpll       =      vector<pll> ;
using          mll        =      map<ll, ll> ;
using          mcl        =      map<char, ll> ;
using          msl        =      map<string,ll> ;
using          sl         =      set<ll> ;
using          sc         =      set<char> ;
using          dl         =      deque<ll> ;
const int N = 1e6+5 ;

ll      mod = 1e9+7 ;
vl      adj[N] ;
vpll    adjc[N] ;
ll      vis[N] ;
ll      arr[N] ;



int main()
{
    IOS;
    ll a, b, c, d, n, m, p, x, y, z, i, j, k, f = 0, tc, cnt = 0, sum = 0, mul = 1, mi = 1e18, ma = -1e18, cs;
    string   str ;
    char     ch ;
    double   db ;
    ll       l, r ;
    //code

   cin>>a>>b>>c>>d;
   if(a==b+c+d)
   {
           cout<<"Yes\n";
   }
   else if(b==a+c+d)
   {
           cout<<"Yes\n";
   }
   else if(c==a+b+d)
   {
           cout<<"Yes\n";
   }
   else if(d==a+b+c)
   {
           cout<<"Yes\n";
   }
   else if(a+b==c+d)
   {
           cout<<"Yes\n";
   }
   else if(a+c==b+d)
   {
           cout<<"Yes\n";
   }
   else if(a+d==b+c)
   {
          cout<<"Yes\n";
   }
   else cout<<"No\n";


    //code
    return 0;
}



#include<cstdio>
#include<queue>

int main(){
    int sum = 0;
    int a[15];
    for(int i = 1; i <= 4; i++){
        scanf("%d",&a[i]);
        sum += a[i];
    }
    int ok = 0;
    for(int i = 1; i < (1<<4); i++){
        int mask = i;
        int cur = 0;
        for(int j = 1; j <= 4; j++){
            if(mask%2) cur += a[j];
            mask /= 2;
        }
        if(cur*2==sum) ok = 1;
    }
    if(ok) printf("Yes\n");
    else printf("No\n");
    return 0;
}
