#include <iostream>
//#include<atcoder/all>
#include <numeric>
#include <cmath>
#include <limits>
#include <stdio.h>
#include <iomanip>
#include <string> 
#include <vector>
#include <algorithm>
#include <utility> 
#include <tuple> 
#include <cstdint> 
#include <cstdio> 
#include <map> 
#include <queue>
#include <set> 
#include <stack> 
#include <deque> 
#include <unordered_map> 
#include <unordered_set>
#include <bitset> 
#include <cctype>
//using namespace atcoder;
using namespace std;
using ll = long long;
#define all(A) A.begin(),A.end()
using vll = vector<ll>;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
using Graph = vector<vector<pair<ll, ll>>>;
vector<bool> seen;
bool C = true;
vector<ll> dist;
ll mod = 998244353;


int main() {
    vll A(3), B(3);
    rep(i, 3)cin >> A[i];
    rep(i, 3)cin >> B[i];
    rep(i, 3) {
        rep(j, 3) {
            swap(A[i], B[j]);
            if (abs(A[0]-A[2])*(A[0] - A[1]) * (A[1] - A[2]) < 0 && abs(B[0] - B[2]) * (B[0] - B[1]) * (B[1] - B[2]) < 0) {
                cout << "Yes" << endl;
                return 0;
            }



            swap(A[i], B[j]);
        }
    }

    cout << "No" << endl;

}