Yandex.Algorithm2017, warmup, B

#define _CRT_SECURE_NO_WARNINGS

#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <cstdio>

//#include <cstdint>
//#include <cstdlib>
#include <cassert>
//#include <cctype>
#include <climits>
#include <functional>
#include <numeric>
#include <algorithm>
#include <cmath>
#include <ctime>

#include <string>
#include <cstring>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <list>
#include <deque>
#include <unordered_set>
#include <unordered_map>
#include <bitset>
#include <array>

using namespace std;

#define forn(i, n) for(int i = 0; i < int(n); i++)
#define forn1(i, n) for(int i = 1; i <= int(n); i++)
#define sz(a) int((a).size())
#define all(a) (a).begin(), (a).end()
#define mp make_pair
#define pb push_back
#define x first
#define y second

typedef long long li;
typedef long double ld;
typedef pair<int, int> pt;

const int INF = int(1e9);
const li INF64 = li(1e18);
const ld PI = acosl(ld(-1));
const ld EPS = 1e-9;

template <typename T> inline T sqr(const T& x) {
    return x * x;
}

template <typename T> inline T abs(const T& x) {
    return x > 0 ? x : -x;
}

inline bool inside(int x, int y, int n, int m) {
    return x >= 1 && x <= n && y >= 1 && y <= m;
}

inline int rnd() {
    return abs(rand() ^ (rand() << 15));
}

inline int rnd(int n) {
    assert(n > 0);
    return rnd() % n;
}

inline int rnd(int lf, int rg) {
    return lf + rnd(rg - lf + 1);
}

inline li rndLL() {
    return rnd() * 1LL * rnd() + rnd();
}

const int dx[4] = { -1, 0, +1, 0 };
const int dy[4] = { 0, +1, 0, -1 };

const int dx8[8] = { -1, -1, 0, +1, +1, +1, 0, -1 };
const int dy8[8] = { 0, +1, +1, +1, 0, -1, -1, -1 };

const int N = int(1e6) + 555;

int n, a[N];

inline void gen() {
    return;
}

inline bool read() {
    forn(i, 4) assert(cin >> a[i]);
    return true;
}

inline void solve() {
    sort(a, a + n);
    assert(a[0]);
    int cnt = 0;
    /*
    forn(i, 4) {
        li sum = 0;
        forn(j, 4) if (i != j) sum += a[j];
        if (a[i] >= sum) {
            puts("No");
            return;
        }
    }
    */

    if (a[0] + a[3] == a[1] + a[2]) puts("Yes");
    else puts("No");
    return;
}

int main() {
    //assert(false);
#ifdef _DEBUG
    assert(freopen("input.txt", "rt", stdin));
    assert(freopen("output.txt", "wt", stdout));
#endif

    cout << setprecision(10) << fixed;
    cerr << setprecision(10) << fixed;

    srand(int(time(NULL)));

    int T = 1;
    //#define MULTITEST
#ifdef MULTITEST
    assert(scanf("%d", &T) == 1);
#endif

    forn(i, T) {
#ifdef _DEBUG
        cerr << "TEST == " << i << endl;
#endif
        assert(read());
        //read();
        //cout << "Case #" << i + 1 << ": ";
        solve();
        //cerr << "curTime == " << clock() << " ms" << endl;
    }

#ifdef _DEBUG
    cerr << "TIME == " << clock() << " ms" << endl;
#endif
    return 0;
}