#include <bits/stdc++.h>
#define FastIO (cin.tie(0), cout.tie(0), ios::sync_with_stdio(false))
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;

bool IsKadomatsu(vector<int> a) {
  if (a[0] == a[1] || a[1] == a[2] || a[0] == a[2]) return false;
  int mmin = min(a[0], min(a[1], a[2]));
  int mmax = max(a[0], max(a[1], a[2]));
  return mmin == a[1] || mmax == a[1];
}

void Trace(vector<int> ai) {
  for (const auto a : ai) cout << a;
  cout << '\n';
}

void solve() {
  vector<int> ai(3), bi(3);
  for (auto &a : ai) cin >> a;
  for (auto &b : bi) cin >> b;

  for (int i = 0; i < 3; i++) {
    vector<int> A = ai, B = bi;
    for (int j = 0; j < 3; j++) {
      auto tmp = A[i];
      A[i] = B[j];
      B[j] = tmp;

      // Trace(A);
      // Trace(B);

      if (IsKadomatsu(A) == true && IsKadomatsu(B) == true) {
        cout << "Yes" << '\n';
        return;
      }
    }
  }
  cout << "No" << '\n';
  return;
}

int main() {
  FastIO;
  solve();
  return 0;
}