#include <bits/stdc++.h>
#include <regex>
#include <string.h>
#define rep(i,n) for(int i = 0; i < n; i++)
#define srep(i,a,b) for(int i = a; i < b; i++)
#define all(A) (A).begin(),A.end()
#define MOD 1000000007
using namespace std;
using ll = long long;
using P = pair<char,int>;
using Graph = vector<vector<int>>;

int is_kado(vector<int> &X){
	if(X[0] != X[1] && X[1] != X[2] && X[2] != X[0] &&
			(max({X[0],X[1],X[2]}) == X[1] || min({X[0],X[1],X[2]}) == X[1])) return true;
	return true;
}

int main(void){
	vector<int> A(3),B(3);
	rep(i,3) cin >> A[i];
	rep(i,3) cin >> B[i];
	sort(all(A)); sort(all(B));
	if(A == B){
		cout << "No";
		return 0;
	}

	rep(i,3){
		rep(j,3){
			swap(A[i],B[j]);
			bool oka = is_kado(A),okb = is_kado(B);
			if(oka && okb){
				cout << "Yes";
				return 0;
			}
			swap(A[i],B[j]);
		}
	}
	cout << "No";
}