#include <bits/stdc++.h>
using namespace std;
static const int di[] = {-1, 0, 1, -1, 1, -1, 0, 1};
static const int dj[] = {-1, -1, -1, 0, 0, 1, 1, 1};
void debug(const char *format, ...) {
  va_list arg;
  va_start(arg, format);
  vprintf(format, arg);
  va_end(arg);
}
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
  std::fill((T *)array, (T *)(array + N), val);
}
class UnionFindTree {
  struct node {
    int par;
  };
  std::vector<node> T;

 public:
  void init(int num) {
    T.resize(num + 1);
    for (int i = 1; i <= num; ++i) {
      T[i].par = i;
    }
  }
  void unite(int x, int y) { T[find(y)].par = find(x); }
  int find(int x) {
    if (T[x].par == x)
      return x;
    else
      return T[x].par = find(T[x].par);
  }
  bool same(int x, int y) { return find(x) == find(y); }
};
template <typename T>
class SegmentTree {
 private:
  long long N;
  T INF_VAL;
  T dat[100005 * 2];
  T _query(long long l, long long r, long long l_resp, long long r_resp,
           long long i_dat) {
    debug("query(%lld, %lld, %lld, %lld, %lld) called\n", l, r, l_resp, r_resp,
          i_dat);
    if (r < l_resp || r_resp < l)
      return INF_VAL;
    else if (l <= l_resp && r_resp <= r)
      return dat[i_dat];
    else
      return min(
          _query(l, r, l_resp, (l_resp + r_resp) / 2, i_dat * 2),
          _query(l, r, (l_resp + r_resp) / 2 + 1, r_resp, i_dat * 2 + 1));
  }

 public:
  void init(long long _N, T _inf_val) {
    N = 1;
    while (N < _N) N *= 2;
    INF_VAL = _inf_val;
    Fill(dat, _inf_val);
  }
  T get(long long index) { return dat[index + N]; }
  void set(int index, T val) {
    int i_dat = index + N;
    dat[i_dat] = val;
    for (i_dat /= 2; i_dat > 0; i_dat /= 2) {
      dat[i_dat] = min(dat[i_dat * 2], dat[i_dat * 2 + 1]);
    }
  }
  T query(long long l, long long r) { return _query(l, r, 0, N - 1, 1); }
  void dump() {
    cout << "*** SegTree dump begin ***\n";
    cout << "N = " << N << ", INF_VAL = " << INF_VAL << endl;
    for (int i = 1; i < N * 2; i *= 2) {
      for (int j = i; j < i * 2; ++j) {
        if (dat[j] == INF_VAL)
          cout << "INF ";
        else
          cout << dat[j] << " ";
      }
      cout << endl;
    }
    cout << "*** SegTree dump end ***\n";
  }
};
template <typename T>
class BinaryIndexedTree {
 private:
  long long N;
  T dat[100005 + 1];

 public:
  void init(long long _N) {
    N = _N;
    Fill(dat, 0);
  }
  void add(int i, T val) {
    while (i <= N) {
      dat[i] += val;
      i += i & -i;
    }
  }
  T sum(long long i) {
    T ret = 0;
    while (i > 0) {
      ret += dat[i];
      i -= i & -i;
    }
    return ret;
  }
  T sum(long long left, long long right) { return sum(right) - sum(left - 1); }
  void dump() {
    cout << "*** BITree dump begin ***\n";
    cout << "N = " << N << endl;
    for (int i = 1; i <= N; i *= 2) {
      cout << dat[i] << " ";
    }
    cout << "*** BITree dump end ***\n";
  }
};
long long N, M, K, A, B, C, D, E;
int dp[100005] = {};
long long ans = 0;
void solve() {}
void debug() {}
void answer() {
  if (N + K == M || N + M == K || M + K == N) {
    cout << "Yes\n";
  } else {
    cout << "No\n";
  }
}
int main(int argc, char const *argv[]) {
  scanf("%lld%lld%lld", &N, &M, &K);
  solve();
  debug();
  answer();
  return 0;
}
