#include <bits/stdc++.h>
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define FORR(i,a,b) for (int i=(a);i>=(b);i--)
#define pb push_back
#define pcnt __builtin_popcount
#define show(x) cout<<#x<<" = "<<x<<endl;
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define fi first
#define se second
#define rng(a) a.begin(),a.end()
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define sz(x) (int)(x).size()

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef set<int> si;
typedef pair<ll,ll> pll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pll> vpll;
typedef set<ll> sl;
template<typename T>string join(vector<T>&v)
{stringstream s;FOR(i,0,sz(v))s<<' '<<v[i];return s.str().substr(1);}
ll gcd(ll a,ll b){if(a>b)swap(a,b);for(;a>0;b%=a,swap(a,b));return b;}
int modpow(ll a,ll n,int m){if(a==0)return a;ll p=1;for(;n>0;n/=2,a=a*a%m)if(n&1)p=p*a%m;return(int)p;}
void dout(double d){printf("%.12f\n",d);}

const int iinf = 1e9;
const ll linf = 1e18;
const int mod = 1e9+7;
const double pi = acos(-1);
const double eps = 1e-10;

int d[7];
vi a, b;
bool kdmt(int a, int b, int c){
  return !((a < b && b < c) || (a > b && b > c) || a == b || b == c || c == a);
}
main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  int c = 0;
  FOR(i, 0, 7)cin >> d[i];
  a.resize(3);
  b.resize(4);
  FOR(i, 0, 5)FOR(j, i+1, 6)FOR(k, j+1, 7){
    a[0] = d[i];
    a[1] = d[j];
    a[2] = d[k];
    int idx = 0;
    FOR(l, 0, 7){
      if(l == i || l == j || l == k)continue;
      b[idx] = d[l];
      idx++;
    }
    sort(rng(a));
    sort(rng(b));
    bool ok = true;
    FOR(l, 0, 3) ok &= kdmt(b[l], a[l], b[l+1]);
    FOR(l, 0, 2) ok &= kdmt(a[l], b[l+1], a[l+1]);
    if(ok){
      cout << "YES" << endl;
      return 0;
    }
  }
  cout << "NO" << endl;
}