#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define array2(type, x, y) array<array<type, y>, x>
#define vector2(type) vector<vector<type> >
#define out(...) printf(__VA_ARGS__)

int dxy[] = {0, 1, 0, -1, 0};

/*================================*/

int N,M,L;
int D[7];

bool increasing(int a, int b, int c) {
    if (a == b || b == c || c == a) return false;
    if (!(b < a && b < c) && !(b > a && b > c)) return false;
    return (a < c);
}

bool ok() {
    REP(i, 5) {
        if (!increasing(D[i], D[i+1], D[i+2])) return false;
    }
    return true;
}

signed main()
{
#if DEBUG
    std::ifstream in("input.txt");
    std::cin.rdbuf(in.rdbuf());
#endif
    REP(i, 7) cin >> D[i];
    sort(D, D+7);
    
    do {
        if (ok()) {
            cout << "YES" << endl;
            return 0;
        }
    } while (next_permutation(D, D+7));

    cout << "NO" << endl;
    
    return 0;
}