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

static inline void solve() {
  long long a, b, c, x;
  cin >> a >> b >> c >> x;
  if (a > b) {
    swap(a, b);
  }
  if (a > c) {
    swap(a, c);
  }
  if (b > c) {
    swap(b, c);
  }
  set<long long> st = {0LL,
                       a,
                       b,
                       c,
                       a + b,
                       a + c,
                       b + c,
                       c - b,
                       c - a,
                       b - a,
                       max(0LL, c - b - a),
                       max(0LL, a - (c - b)),
                       max(0LL, b - (c - a)),
                       max(0LL, c - (b - a)),
                       a + c - b,
                       b + c - a,
                       a + b + c};
  bool ok = false;
  for (long long num: st) {
    ok |= st.count(x % num);
  }
  cout << (ok ? "Yes" : "No") << '\n';
}

int main() {
  ios_base::sync_with_stdio(0), cin.tie(0);
#ifdef LOCAL
  int T;
  cin >> T;
  for (int tc = 1; tc <= T; tc++) {
    cout << "Case" << tc << ":" << '\n';
    solve();
  }
#else
  solve();
#endif
  return 0;
}