#include <bits/stdc++.h>
using namespace std;
int a[4];
bool fre[1000010], fre1[100010], cn;
bool check() {
  for (int i = 1; i <= 1000000; i++)
    if (!fre[i]) return false;
  return true;
}
void sinh(int x, int cs) {
  int cur = x;
  while (cur <= 1000000) {
    fre[cur] = true;
    cur += cs;
  }
}
void rev(int x, int cs) {
  int cur = x;
  while (cur <= 1000000) {
    fre[cur] = false;
    cur += cs;
  }
}
int ff() {
  for (int i = 1; i <= 1000000; i++)
    if (!fre[i]) return i;
}
void solv(int x, int y, int z) {
  sinh(1, x);
  int p1, p2;
  p1 = ff();
  sinh(p1, y);
  p2 = ff();
  sinh(p2, z);
  if (check()) {
    cn = true;
    return;
  }
  rev(p1, y);
  rev(p2, z);
  p1 = ff();
  sinh(p1, z);
  p2 = ff();
  sinh(p2, y);
  if (check()) {
    cn = true;
    return;
  }
}
int main() {
  cin >> a[1] >> a[2] >> a[3];
  cn = false;
  memset(fre, false, sizeof fre);
  solv(a[1], a[2], a[3]);
  memset(fre, false, sizeof fre);
  solv(a[2], a[1], a[3]);
  memset(fre, false, sizeof fre);
  solv(a[3], a[2], a[1]);
  if (!cn)
    cout << "NO";
  else
    cout << "YES";
  return 0;
}
