#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;
}
#define  _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;

int main() {
	int a, b, c;
	cin >> a >> b >> c;
	int ans = 0;
	ans = max(ans, a + b);
	ans = max(ans, a + c);
	ans = max(ans, b + c);
	cout << ans << endl;
}