#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208;

bool IsKadomatsu(int a, int b, int c){
    if(a == b || b == c || c == a) return false;
    return max({a, b, c}) == b || min({a, b, c}) == b;
}
int main() {
    vector<int> a(3), b(3);
    for (auto &&i : a) scanf("%d", &i);
    for (auto &&i : b) scanf("%d", &i);
    for (int i = 0; i < 3; ++i) {
        for (int j = 0; j < 3; ++j) {
            swap(a[i], b[j]);

            if(IsKadomatsu(a[0], a[1], a[2]) && IsKadomatsu(b[0], b[1], b[2])){
                puts("Yes");
                return 0;
            }
            swap(a[i], b[j]);
        }
    }
    puts("No");
    return 0;
}