#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define mt make_tuple
#define pqueue priority_queue
const int inf=1e9+7;
const ll mod=1e9+7;
const ll mod1=998244353;
const ll big=1e18;
const double PI=2*asin(1);

int main() {
  int A, B, C, D, E, F;
  cin>>A>>B>>C>>D>>E>>F;
  if(A==D && B==E && C==F) {
    cout<<"Yes"<<endl;
    cout<<"2"<<endl;
    return 0;
  }
  vector<int> arr1(3), arr2(3);
  arr1[0] = A;
  arr1[1] = B;
  arr1[2] = C;
  arr2[0] = D;
  arr2[1] = E;
  arr2[2] = F;
  sort(arr1.begin(), arr1.end());
  sort(arr2.begin(), arr2.end());
  bool ok = true;
  for(int i=0;i<3;++i) {
    if(arr1[i]!=arr2[i]) ok = false;
  }
  if(!ok) {
    cout<<"No"<<endl;
    return 0;
  }
  cout<<"Yes"<<endl;
  cout<<"2"<<endl;
}