#include<bits/stdc++.h>
using namespace std;
//#define int long long
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define endl '\n'
#define vec vector<ll>
#define mat vector<vector<ll> >
#define fi first
#define se second
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> pll;
typedef long double ld;
typedef complex<double> Complex;
const ll INF=1e9+7;
const ll inf=INF*INF;
const ll mod=998244353;
const ll MAX=100010;




signed main(){
    vector<ll>a(3);
    vector<ll>b(3);
    rep(i,3)cin>>a[i];
    rep(i,3)cin>>b[i];
    bool f=0;
    rep(i,3){
        rep(j,3){
            vector<ll>c(3);
            vector<ll>d(3);
            rep(k,3){
                if(k==i)c[k]=b[j];
                else c[k]=a[k];
                if(k==j)d[k]=a[i];
                else d[k]=b[k];
            }
            bool g=0;
            if(((c[0]>c[1]&&c[2]>c[1])||(c[0]<c[1]&&c[2]<c[1]))&&((d[0]>d[1]&&d[2]>d[1])||(d[0]<d[1]&&d[2]<d[1]))){
                g=1;
            }
            sort(all(c)),sort(all(d));
            rep(k,2){
                if(c[k]==c[k+1]||d[k]==d[k+1])g=0;
            }
            f|=g;
        }
    }
    cout<<(f?"Yes":"No")<<endl;
}