#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9, MOD = 1e9 + 7,
          around[] = {0, 1, 1, -1, -1, 0, -1, 1, 0, 0};
const long long LINF = 1e18;
const long double PI = abs(acos(-1));
int a, b, c;
int main() {
  cin >> a >> b >> c;
  for (int x1 = (0); x1 < (3); x1++) {
    for (int x2 = (0); x2 < (3); x2++) {
      for (int x3 = (0); x3 < (3); x3++) {
        bool li[1500 * 1510 + 1] = {};
        int ma = 0;
        for (int i = (0); i < (max(a, max(b, c))); i++) {
          li[x1 + a * i] = li[x2 + b * i] = li[x3 + c * i] = true;
          ma = max(x1 + a * i, max(x2 + b * i, x3 + c * i));
        }
        for (int i = 0; x1 + a * i < ma; i++) li[x1 + a * i] = true;
        for (int i = 0; x2 + b * i < ma; i++) li[x2 + b * i] = true;
        for (int i = 0; x3 + c * i < ma; i++) li[x3 + c * i] = true;
        bool f = true;
        for (int i = (0); i < (ma + 1); i++) f = f & li[i];
        if (f) {
          cout << "YES" << endl;
          return 0;
        }
      }
    }
  }
  cout << "NO" << endl;
  return 0;
}
