#include <iostream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <math.h>
#include <string>
#include <numeric>
#include <queue>
#include <cstdio>
#include <cstring>
#define ll long long
#define rep(i,n) for(ll i=0;i<n;++i)
#define rep1(i,n) for(ll i=1;i<n;++i)
#define mrep(i,n) for(ll i=n;i>=0;--i)
#define all(a) (a).begin(),(a).end()
#define vl vector<ll>
#define vvl vector<vector<ll> >
#define vb vector<bool>
#define vvb vector<vector<bool> >
#define pl pair<ll,ll>
#define inf 1001001001001001000
#define mod 1000000007
//#define mod 998244353
#define pi 3.1415926535
using namespace std;
struct __INIT{
    __INIT(){
        cin.tie(0);
        ios::sync_with_stdio(false);
        cout<<fixed<<setprecision(15);
    }
}__init;

ll mpow(ll a,ll b){
    if(b == 0) return 1;
    if(b == 1) return a%mod;
    if(b%2 == 0) return mpow((a*a)%mod,b/2)%mod;
    else return (a%mod)*mpow((a*a)%mod,(b-1)/2)%mod;
}

int main(){
    vl abc(3);
    vl xyz(3);
    cin>>abc[0]>>abc[1]>>abc[2];
    cin>>xyz[0]>>xyz[1]>>xyz[2];
    if(abc[0] == xyz[0] && abc[1] == xyz[1] && abc[2] == xyz[2]){
        cout<<"Yes"<<endl;
        cout<<2<<endl;
        return 0;
    }
    sort(all(abc));
    sort(all(xyz));
    if(abc[0] == xyz[0] && abc[1] == xyz[1] && abc[2] == xyz[2]){
        cout<<"Yes"<<endl;
        cout<<2<<endl;
    }
    else{
        cout<<"No"<<endl;
    }
}