#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using ull = unsigned long long;
#define v(t) vector<t>
#define p(t) pair<t, t>
#define p2(t, s) pair<t, s>
#define vp(t) v(p(t))

#define rep(i, n) for (int i=0,i##_len=((int)(n)); i<i##_len; ++i)
#define rep2(i, a, n) for (int i=((int)(a)),i##_len=((int)(n)); i<=i##_len; ++i)
#define repr(i, n) for (int i=((int)(n)-1); i>=0; --i)
#define rep2r(i, a, n) for (int i=((int)(n)),i##_len=((int)(a)); i>=i##_len; --i)

#define repi(itr, c) for (__typeof((c).begin()) itr=(c).begin(); itr!=(c).end(); ++itr)
#define repir(itr, c) for (__typeof((c).rbegin()) itr=(c).rbegin(); itr!=(c).rend(); ++itr)

#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()

#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define RSORT(x) sort(rall(x));
#define pb push_back
#define eb emplace_back

#define INF (1e9)
#define LINF (1e18)
#define PI (acos(-1))
#define EPS (1e-7)
#define DEPS (1e-10)

int main(){
    v(int) a(3), b(3), a2, b2;
    rep(i, 3) cin >> a[i];
    rep(i, 3) cin >> b[i];
    bool ans = false;
    rep(i, 3) rep(j, 3) {
        a2 = a; b2 = b;
        swap(a2[i], b2[j]);
        bool aok = true, bok = true;
        if (a2[0]==a2[1] || a2[1]==a2[2] || a2[0]==a2[2]) aok = false;
        if (!(a2[1]<a2[0]&&a2[1]<a2[2]) && !(a2[1]>a2[0]&&a2[1]>a2[2])) aok = false;
        if (b2[0]==b2[1] || b2[1]==b2[2] || b2[0]==b2[2]) bok = false;
        if (!(b2[1]<b2[0]&&b2[1]<b2[2]) && !(b2[1]>b2[0]&&b2[1]>b2[2])) bok = false;
        if (aok && bok) ans = true;
    }
    if (ans) cout << "Yes" << endl;
    else cout << "No" << endl;
    return 0;
}