#include <bits/stdc++.h>
using namespace std;

int main()
{
  vector< int > D(7);
  for(int i = 0; i < 7; i++) {
    cin >> D[i];
  }
  sort(D.begin(), D.end());
  
  bool flag = false;
  do {
    bool isk = true;
    for(int i = 0; i < 5; i++) {
      if(D[i] >= D[i + 2]) isk = false;
      int small = min({D[i], D[i + 1], D[i + 2]});
      int big = max({D[i], D[i + 1], D[i + 2]});
      if(count(D.begin() + i, D.begin() + i + 3, small) == 1 && count(D.begin() + i, D.begin() + i + 3, big) == 1) {
        if(small == D[i + 1] || big == D[i + 1]) {}
        else isk = false;
      } else {
        isk = false;
      }
    }
    if(isk) flag = true;
  } while(next_permutation(D.begin(), D.end()));

  if(flag) cout << "YES" << endl;
  else cout << "NO" << endl;

}