#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>

#define REP(i,s,n) for(int i=(int)(s);i<(int)(n);i++)

using namespace std;
typedef long long int ll;
typedef vector<int> VI;
typedef pair<int, int> PI;
const double EPS=1e-9;

bool check(vector<int> &t) {
REP(i, 0, 5) {
if (!(t[i] < t[i + 2] && (t[i + 1] < t[i] || t[i + 1] > t[i + 2]))) return 0;
}
return 1;
}

int main(void){
	int a[7];
REP(i,0,7)cin>>a[i];
vector<int> perm = {0,1,2,3,4,5,6};
bool ok = 0;
do {
vector<int> t(7);
REP(i, 0, 7) t[i] = a[perm[i]];
ok |= check(t);
} while (next_permutation(perm.begin(), perm.end()));
cout << (ok ? "YES" : "NO") << endl;
}