#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <utility>
#include <set>
#include <map>
#include <cmath>
#include <queue>
#include <cstdio>
#include <limits>
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if(a < b){ a = b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if(a > b){ a = b; return 1; } return 0; }
template<class T> inline int  sz(T &a) { return a.size(); }
using ll = long long; using ld = long double;
using pi = pair<int,int>; using pl = pair<ll,ll>;
using vi = vector<int>; using vvi = vector<vi>;
using vl = vector<ll>; using vvl = vector<vl>;
const int inf = numeric_limits<int>::max();
const ll infll = numeric_limits<ll>::max();
int main()
{
  vi a(3);
  rep(i,3) cin >> a[i];
  vi b(3);
  rep(i,3) cin >> b[i];

  bool f = true;
  sort(a.begin(), a.end());
  sort(b.begin(), b.end());
  rep(i,3) {
    if(a[i] != b[i]) f = false;
  }
  if(f) {
    cout << "Yes" << "\n";
    cout << 2 << "\n";
    return 0;
  }
  else {
    cout << "No" << "\n";
  }
  
  return 0;
}