#include <bits/stdc++.h>
//#include <iostream>
#include <atcoder/all>
#include <math.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rrep(i, n) for(int i = (n-1); i >= 0; i--)
using namespace std;
using namespace atcoder;
typedef long long ll;
const int MOD = 1000000007;
//const int MOD =  998244353;
 
const ll INF = 1LL<<61;
const int IINF = 1000000000;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

typedef pair<int, int> PI;
typedef pair<ll, ll> P;
typedef pair<string, ll> PS;

using mint = modint1000000007;


int main(){

    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    vector<int> a(3),b(3);
    rep(i,3) cin >> a[i];
    rep(i,3) cin >> b[i];

    bool ans = false;
    for(int i = 0; i < 3; i++){
        for(int j = 0; j < 3; j++){
            vector<int> a2 = a;
            vector<int> b2 = b;
            int tmp = a2[i];
            a2[i] = b2[j];
            b2[j] = tmp;
            bool isok = false;
            if (a2[0] != a2[1] && a2[0] != a2[2] && a2[1] != a2[2]){
                if (a2[0] < a2[1] && a2[1] > a2[2]){
                    isok = true;
                }
                if (a2[0] > a2[1] && a2[1] < a2[2]){
                    isok = true;
                }
            }
            if(!isok) continue;
            isok = false;
            if (b2[0] != b2[1] && b2[0] != b2[2] && b2[1] != b2[2]){
                if (b2[0] < b2[1] && b2[1] > b2[2]){
                    isok = true;
                }
                if (b2[0] > b2[1] && b2[1] < b2[2]){
                    isok = true;
                }
            }
            if(isok) ans = true;
        }
    }
    if(ans) cout << "Yes" << endl;
    else cout << "No" << endl;
}