//#pragma GCC target("avx2")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>

#define ll long long
#define ull unsigned long long
#define ld long double

#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep2(i, a, b) for(int i = a; i <= b; ++i)
#define rrep(i, a, b) for(int i = a; i >= b; --i)

#define pii pair<int, int>
#define pll pair<ll, ll>

#define fi first
#define se second

#define pb push_back
#define eb emplace_back

#define vi vector<int>
#define vll vector<ll>
#define vpii vector<pii>
#define vpll vector<pll>
#define vvi(a,b,c,d) vector<vector<int>> a(b,vector<int>(c,d));
#define vvll(a,b,c,d) vector<vector<ll>> a(b,vector<ll>(c,d));

#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define sz(c) ((ll)(c).size())

#define endl '\n'
using namespace std;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }

const int MOD = 1000000007;
//const int MOD = 998244353;
const ll INF = 1e18+1;
const int inf = 1e9+1;
const double PI = acos(-1);
int dx[8] = {1, 0, -1,  0,  1, 1, -1, -1};
int dy[8] = {0, 1,  0, -1, -1, 1,  1, -1};

bool range(int y, int x, int h, int w){
  if(y < 0 || x < 0 || y >= h || x >= w) return false;
  else return true;
}

const int M = 510000;

signed main(){
  cin.tie(0);
  ios::sync_with_stdio(false); 
  cout << fixed << setprecision(10);
  
  vector<int> a(3), b(3);
  rep(i, 3) cin >> a[i];
  rep(i, 3) cin >> b[i];
  
  bool ok = false;
  rep(i, 3)rep(j, 3){
    bool flag = true;
    swap(a[i], b[j]);
    if(a[0] == a[1] || a[1] == a[2] || a[2] == a[0]) flag = false;
    if(b[0] == b[1] || b[1] == b[2] || b[2] == b[0]) flag = false;
    if(*max_element(all(a)) == a[0] && *min_element(all(a)) == a[2]) flag = false;
    if(*max_element(all(a)) == a[2] && *min_element(all(a)) == a[0]) flag = false;
    if(*max_element(all(b)) == b[0] && *min_element(all(b)) == b[2]) flag = false;
    if(*max_element(all(b)) == b[2] && *min_element(all(b)) == b[0]) flag = false;
    if(flag) ok = true;
    swap(a[i], b[j]);
  }
  if(ok) cout << "Yes" << endl;
  else cout << "No" << endl;
  return 0;
}