#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

#define RREP(i,s,e) for (i = s; i >= e; i--)
#define rrep(i,n) RREP(i,n,0)
#define REP(i,s,e) for (i = s; i < e; i++)
#define rep(i,n) REP(i,0,n)
#define INF 100000000

typedef long long ll;

bool is_kadomatsu(int a, int b, int c) {
    if (a != c && (b < min(a,c) || max(a,c) < b))
        return true;
    else
        return false;
}

int main() {
    int i;
    int d[7];
    int index[2][7] {{0,2,1,4,3,6,5},{1,0,3,2,5,4,6}};
    bool yes, ans = false;
    rep (i,7) cin >> d[i];
    yes = true;
    rep (i,4) yes &= is_kadomatsu(d[index[0][i]],d[index[0][i+1]],d[index[0][i+2]]);
    ans |= yes;
    yes = true;
    rep (i,4) yes &= is_kadomatsu(d[index[1][i]],d[index[1][i+1]],d[index[1][i+2]]);
    ans |= yes;

    if (ans)
        cout << "YES" << endl;
    else
        cout << "NO" << endl;
    return 0;
}