#include <bits/stdc++.h>
using namespace std;
vector<pair<long long, int>> factorize(long long n) {
  vector<pair<long long, int>> res;
  for (long long i = 2; i * i <= n; i++) {
    if (n % i) continue;
    res.emplace_back(i, 0);
    while (n % i == 0) {
      n /= i;
      res.back().second++;
    }
  }
  if (n != 1) res.emplace_back(n, 1);
  return res;
}
void trace(int A[], int N) {
  for (int i = 0; i < N; i++) {
    if (i > 0) printf(" ");
    printf("%d", A[i]);
  }
  printf("\n");
}
int main() {
  int A, B, C;
  cin >> A >> B >> C;
  int S[3] = {A, B, C};
  sort(S, S + 3);
  if (S[0] + S[1] == S[2])
    puts("Yes");
  else
    puts("No");
}
