#include <bits/stdc++.h>
using namespace std;
map<long long int, bool> mp;
int main() {
  long long int k1, k2, k3, i, j, ara[100];
  for (i = 0; i < 3; i++) {
    cin >> ara[i];
  }
  sort(ara, ara + 3);
  if (ara[0] == 1) {
    cout << "YES" << endl;
    return 0;
  }
  k1 = ara[0], k2 = ara[1], k3 = ara[2];
  int cnt = 0, suru = 1;
  while (1) {
    if (cnt == 100) break;
    mp[suru] = true;
    suru += k1;
    cnt++;
  }
  suru = 2;
  cnt = 0;
  while (1) {
    if (cnt == 100) break;
    mp[suru] = true;
    suru += k2;
    cnt++;
  }
  vector<int> vv;
  for (i = 1; i <= 100; i++) {
    if (!mp[i]) {
      vv.push_back(i);
    }
  }
  if (vv.size() <= 1) {
    cout << "YES" << endl;
    return 0;
  }
  for (i = 1; i < vv.size(); i++) {
    if (vv[i] - vv[i - 1] != k3) {
      cout << "NO" << endl;
      return 0;
    }
  }
  cout << "YES" << endl;
  return 0;
}
