#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < int(n); i++)
#define rrep(i,n) for(int i = int(n)-1; i >= 0; i--)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define pb push_back
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
int dx[] = {1, 0,-1, 0, 1, 1,-1,-1};
int dy[] = {0, 1, 0,-1, 1,-1, 1,-1};
ll mod = 998244353;
ll MOD = 1000000007;
int inf = 1001001001;
ll INF = 1001001001001001001;
int a[5],b[5];
int main() {
    cin >> a[0] >> a[1] >> a[2] >> b[0] >> b[1] >> b[2];
    bool flag = false;
    rep(i,3) {
        rep(j,3) {
            swap(a[i],b[j]);
            bool A = false,B = false;
            if(a[0] < a[1] && a[1] > a[2] && a[0] != a[2]) {
                A = true;
            }
            if(a[0] > a[1] && a[1] < a[2] && a[0] != a[2]) {
                A = true;
            }
            if(b[0] < b[1] && b[1] > b[2] && b[0] != b[2]) {
                B = true;
            }
            if(b[0] > b[1] && b[1] < b[2] && b[0] != b[2]) {
                B = true;
            }
            if(A && B) {
                flag = true;
            }
            swap(a[i],b[j]);
        }
    }
    if(flag) {
        cout << "Yes" << endl;
    }
    else {
        cout << "No" << endl;
    }
}