#include "bits/stdc++.h"
#define _CRT_SECURE_NO_WARNINGS
#define rep(i,n) for(int i = 0;i < n;i++)
#define REP(i,n,k) for(int i = n;i < k;i++)
#define P(p) cout << (p) << endl;
#define sP(p) cout << setprecision(15) << fixed << p << endl;
#define vi vector<int>
#define mp(a,b) make_pair(a,b)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int dx[] = { 1, -1 , 0 , 0};
int dy[] = { 0,  0,  1, -1};

void solve() {
  vector<int> v(7);
  rep(i,7)cin >> v[i];
  sort(v.begin(),v.end());
  do{
    bool flag = true;
    rep(i,5){
      if(v[i] < v[i+2] and (min(v[i],min(v[i+1],v[i+2])) == v[i+1] or max(v[i],max(v[i+1],v[i+2])) == v[i+1]) and v[i] != v[i+1] and v[i+1] != v[i+2] and v[i] != v[i+2]){
      }else{
	flag = false;
      }
    }
    if(flag){
      P("YES");
      return;
    }
  }while(next_permutation(v.begin(),v.end()));
  P("NO");
}

int main() {
  solve();
  return 0;
}