#include <iostream>
#include<utility>
#include <vector>
#include <map>
#include<string>
#include<queue>
#include<math.h>
#define pb push_back
#define all(x) begin(x),end(x)
#define ll long long
#define P pair<int,int>
#define lP pait<ll,ll>
using namespace std;
int main() {
    bool h=0;
    vector<int> a(3),b(3);
    for(int i=0;i<3;i++)
    {
        cin>>a[i];
    }
    for(int i=0;i<3;i++)
    {
        cin>>b[i];
    }
    
    for(int i=0;i<3;i++){
        for(int j=0;j<3;j++){
            bool f=0,g=0;
            swap(a[i],b[j]);
            int c[]={a[0],a[1],a[2]};
            int d[]={b[0],b[1],b[2]};
            sort(all(c));
            sort(all(d));
            if(c[0]!=c[1] and c[1]!=c[2] and c[2]!=c[0]){
            if(c[0]==a[1] or c[2]==a[1]) f=1;
        }
            if(d[0]!=d[1] and d[1]!=d[2] and d[2]!=d[0]){
                if(d[0]==b[1] or d[2]==b[1]) g=1;
            }
            if(f and g) h=1;
            swap(a[i],b[j]);
        }
    }
    if(h) cout<<"Yes"<<endl;
    else cout<<"No"<<endl;
    return 0;
}