#include<bits/stdc++.h>
using namespace std;

#define int long long
typedef pair<int,int>pint;
typedef vector<int>vint;
typedef vector<pint>vpint;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,f,n) for(int i=(f);i<(n);i++)
#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)
template<class T,class U>inline void chmin(T &t,U f){if(t>f)t=f;}
template<class T,class U>inline void chmax(T &t,U f){if(t<f)t=f;}

int D[7];

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

signed main(){
    rep(i,7)cin>>D[i];
    sort(D,D+7);
    do{
        bool f=true;
        rep(i,5)f&=ok(D[i],D[i+1],D[i+2]);
        if(f){
            cout<<"YES"<<endl;
            return 0;
        }
    }while(next_permutation(D,D+7));
    cout<<"NO"<<endl;
    return 0;
}