#include<iostream>
#include<sstream>
#include<cstdio>
#include<cstring>
#include<string>
#include<vector>
#include<list>
#include<queue>
#include<stack>
#include<utility>
#include <fstream>
#include<set>
#include<map>
#include<cctype>
#include<cmath>
#include<algorithm>
#include <numeric>
using namespace std;


#define RALL(x) (x).rbegin(),(x).rend()
#define ALL(x) (x).begin(),(x).end()
#define repp(i,n) for(int (i)=1;(i)<=(n);(i)++)
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rev(i,n) for(int (i)=(n-1);(i)>=0;(i)--)
#define clr(a) memset((a), 0 ,Nof(a))
#define found(s,e) ((s).find(e)!=(s).end())

typedef pair<int,int> P;
typedef vector<pair<int,int> > pii;
typedef map<string,int> mdi;


int A[10];
int main(){
	queue<int> ue,ue2;
	vector<int>v;
	for(int i=0;i<7;i++) cin >> A[i];
	
	sort(A,A+7);
	for(int i=0;i<7;i++){
		if(i<3) ue.push(A[i]);
		else ue2.push(A[i]);
	}
	
	for(int i=0;i<7;i++){
		if(i%2){
			v.push_back(ue.front());
			ue.pop();
		}
		else{
			v.push_back(ue2.front());
			ue2.pop();
		}
	}
	
	
	bool ok=true;
	for(int i=3;i<v.size();i+=2){
		if(i%2&&v[i]<=v[i-2]) ok=false; 
	}
	for(int i=2;i<v.size();i+=2){
		if(i%2==0&&v[i]<=v[i-2]) ok=false; 
	}
	
	swap(v[0],v[5]);
	bool ok2=true;
	for(int i=3;i<v.size();i+=2){
		if(i%2&&v[i]<=v[i-2]) ok2=false; 
	}
	for(int i=2;i<v.size();i+=2){
		if(i%2==0&&v[i]<=v[i-2]) ok2=false; 
	}
	
	
	
	
	if(ok||ok2) cout << "YES" << endl;
	else cout << "NO" << endl;
	
	return 0;
}