#include <bits/stdc++.h>

using namespace std;

#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()

template<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; }
template<typename A, typename B> inline bool chmin(A &a, B b) { if (a>b) { a=b; return 1; } return 0; }

typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, pii> P;

const ll INF = 1ll<<29;
const ll MOD = 1000000007;
const double EPS  = 1e-10;

int main() {
	int d[7];
	REP(i, 7) scanf("%d", d + i);
	sort(d, d + 7);
	
	bool ans = false;
	
	do {
		
		bool now = true;
		FOR(i, 1, 6) {
			if (d[i - 1] == d[i] || d[i] == d[i + 1] || d[i - 1] == d[i + 1]) now = false;
			if ( !(d[i] > max(d[i - 1], d[i + 1]) || d[i] < min(d[i - 1], d[i + 1])) ) now = false;
			if (d[i - 1] >= d[i + 1]) now = false;
		}
		if (now) ans = true;
		
	} while (next_permutation(d, d + 7));
	
	puts(ans ? "YES" : "NO");
	return 0;
}