#include <bits/stdc++.h>
using namespace std;
int a, b, c;
int f[3];
int temp = 0;
int k[800000];
bool check(int f[]) {
  memset(k, 0, sizeof(k));
  for (int i = 0; i <= 30; i++) {
    k[1 + i * f[0]] = 1;
    k[2 + i * f[1]] = 1;
    k[3 + i * f[2]] = 1;
  }
  for (int j = 1; j <= 20; j++) {
    if (k[j] != 1) {
      return 0;
    }
  }
  return 1;
}
int main() {
  cin >> a >> b >> c;
  if (!(a > 10 && b > 10 && c > 10)) {
    f[0] = a;
    f[1] = b;
    f[2] = c;
    sort(f, f + 3);
    do {
      if (check(f)) {
        temp = 1;
      }
    } while (next_permutation(f, f + 3));
  }
  if (temp == 1)
    cout << "YES" << endl;
  else
    cout << "NO" << endl;
}
