#include <bits/stdc++.h>
int descending_compare(const void *a, const void *b) {
  if (*(long long *)a > *(long long *)b) {
    return -1;
  } else if (*(long long *)a == *(long long *)b) {
    return 0;
  } else {
    return 1;
  }
}
int ascending_compare(const void *a, const void *b) {
  if (*(int *)a < *(int *)b) {
    return -1;
  } else if (*(int *)a == *(int *)b) {
    return 0;
  } else {
    return 1;
  }
}
int lower_bound(int *a, int n, int key) {
  int left, mid, right;
  left = 0, right = n;
  mid = (left + right) / 2;
  while ((left + 1 != mid || mid + 1 != right) && mid != left) {
    if (key > a[mid]) {
      left = mid;
    } else {
      right = mid + 1;
    }
    mid = (left + right) / 2;
  }
  if (a[left] >= key) return left;
  if (a[mid] >= key) return mid;
  if (a[right] >= key) return right;
  return n;
}
unsigned long gcd(unsigned long x, unsigned long y) {
  if (y == 0) {
    return x;
  } else if (x > y) {
    return gcd(y, x % y);
  } else {
    return gcd(x, y % x);
  }
}
unsigned long lcm(unsigned long x, unsigned long y) {
  unsigned long g = gcd(x, y);
  return x * y / g;
}
long long factorial(int x) {
  long long rtn = 1;
  int i;
  for (i = x; i > 1; i--) {
    rtn = (rtn * i);
  }
  return rtn;
}
int head[1005];
int next[2005];
int to[2005];
int weight[2005];
long long v[1005] = {0};
int vb[1005] = {0};
int n, m;
int vton[1005] = {0};
int first_to_v[1005] = {0};
int closed[1005] = {0};
int start;
int dfs(int crt) {
  int edge = head[crt];
  while (edge != -1) {
    if (vb[to[edge]] != 1 && v[to[edge]] < v[crt] + weight[edge]) {
      v[to[edge]] = v[crt] + weight[edge];
      vb[to[edge]] = 1;
      dfs(to[edge]);
    }
    edge = next[edge];
  }
  vb[crt] = 0;
  return 0;
}
int check_closed(int crt) {
  int edge = head[crt];
  while (edge != -1) {
    if ((to[edge] == start || vb[to[edge]] != 1) &&
        v[to[edge]] < v[crt] + weight[edge]) {
      v[to[edge]] = v[crt] + weight[edge];
      vb[to[edge]]++;
      check_closed(to[edge]);
    }
    edge = next[edge];
  }
  vb[crt]--;
  return 0;
}
int main(void) {
  int input[3];
  int total = 0;
  for (int i = 0; i < 3; i++) {
    scanf("%d", input[i]);
    total += input[i];
  }
  for (int i = 0; i < 3; i++) {
    if (total % 2 == 0 && input[i] == total / 2) {
      printf("Yes\n");
      return 0;
    }
  }
  printf("No\n");
  return 0;
}
