#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[8]={-1,0,1,0,1,1,-1,-1};
const ll dx[8]={0,-1,0,1,1,-1,1,-1};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
bool check(vl a){
  if(a[0]!=a[1]&&a[1]!=a[2]&&a[0]!=a[2]){
    ll p=a[1];
    sort(all(a));
    if(a[1]==p)return false;
    else return true;
  }
  return false;
}
int main(){
  vl 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){
      swap(a[i],b[j]);
      if(check(a)&&check(b))ok=true;
      swap(a[i],b[j]);
    }
  }
  cout << (ok? "Yes":"No") <<endl;
}