#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using pii = pair<int, int>;
constexpr ll INF = 1ll<<30;
constexpr ll longINF = 1ll<<60;
constexpr ll MOD = 1000000007;
constexpr bool debug = false;
//---------------------------------//

int main() {
	int A[3], B[3];
	REP(i, 3) cin >> A[i];
	REP(i, 3) cin >> B[i];
	
	REP(i, 3) REP(j, 3) {
		swap(A[i], B[j]);
		
		auto kadomatsu = [](int a[3]) -> bool {
			if (a[0] == a[2]) return false;
			if (a[0] > a[1] && a[1] < a[2]) return true;
			if (a[0] < a[1] && a[1] > a[2]) return true;
			return false;
		};
		
		if (kadomatsu(A) && kadomatsu(B)) {
			puts("Yes");
			return 0;
		}
		
		swap(A[i], B[j]);
	}
	
	puts("No");
}