#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int A[3],B[3];
void solve() {
	int i,j,k,l,r,x,y; string s;
	
	FOR(i,3) cin>>A[i];
	FOR(i,3) cin>>B[i];
	FOR(x,3) FOR(y,3) {
		swap(A[x],B[y]);
		int ok=1;
		if(A[0]==A[1]||A[1]==A[2]||A[0]==A[2]) ok=0;
		if(B[0]==B[1]||B[1]==B[2]||B[0]==B[2]) ok=0;
		if((A[0]<A[1])!=(A[2]<A[1])) ok=0;
		if((B[0]<B[1])!=(B[2]<B[1])) ok=0;
		if(ok) return _P("Yes\n");
		swap(A[x],B[y]);
	}
	_P("No\n");
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}