#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll n;

ll f(ll k){
    return k*(k+1)/2;
}

bool ok(ll k){
    return f(k) <= n+1 and n+1 < f(k+1);
}

int main(void){
    cin >> n;
    ll left = 1, right = n, k;
    while(true){
        ll m = (left+right)/2;
        if(m<=2*(n+1)/(m+1) and 2*(n+1)/(m+1)<m+2){
            k = m;
            break;
        } else if(m+1<2*(n+1)/m){
            left = m+1;
        } else {
            right = m-1;
        }
    }
    cout << n-k+1 << endl;
    return 0;
}
/*
 * 109109109109109109
 * 109109108641970782
 */

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


/* エイリアス */
#define ll long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vpi vector<pii>
#define vpll vector<pll>
#define endl '\n'

#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define em emplace
#define mp make_pair


/* 関数マクロ */
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define rep2(i, n, m) for (ll i = n; i <= m; ++i)
#define rep3(i, n, m) for (ll i = n; i >= m; --i)
#define all(v) v.begin(), v.end()
#define si(v) int(v.size())
#define UNIQUE(v) sort(all(v)), v.erase(unique(all(v)),v.end())


/* 定数 */
const ll mod = 1e9 + 7;
const ll infll = (1LL << 62) - 1;
const ll inf = (1LL << 30) - 1;


/* その他 */
template<class S, class T> inline bool chmax(S &a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class S, class T> inline bool chmin(S &a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T> using pq = priority_queue<T>;
template<class T> using pqg = priority_queue<T, vector<T>, greater<T>>;


signed main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  cout << fixed << setprecision(15);

  vi a(4);
  rep(i, 4) cin >> a[i];

  sort(all(a));
  int sum = accumulate(all(a),0);

  do {
    int s = 0;
    rep(i, 4) {
      s += a[i];
      int eat = sum - s;

      if (s == eat) {
        cout << "Yes" << endl;
        return 0;
      }
    }

  } while (next_permutation(all(a)));


  cout << "No" << endl;
}
