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

#define ll long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define P pair<int, int>

bool isKadomatsu(vector<int> a) {
  if (a[0] != a[2]) {
    if (a[0] < a[1] && a[1] > a[2]) return true;
    if (a[0] > a[1] && a[1] < a[2]) return true;
  }
  return false;
} 

bool solve(int i, int j, vector<int> a, vector<int> b) {
  swap(a[i], b[j]);
  if (isKadomatsu(a) && isKadomatsu(b)) return true;
  else return false;
}

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

  rep(i,3)rep(j,3) {
    if (solve(i,j,a,b)) {
      cout << "Yes" << endl;
      return 0;
    }
  }
  cout << "No" << endl;



}