#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
const long double eps = 1e-7;
const int inf = 1000000010;
const long long INF = 10000000000000010LL;
const int mod = 1000000007;
const int MAXN = 100010;
int n, m, k, u, v, x, y, t, a, b, ans;
string A[5];
string s;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> s;
  for (int i = 0; i < 5; i++) {
    cin >> A[i];
    if (A[i][0] == s[0] || A[i][1] == s[1]) return cout << "YES" << '\n', 0;
  }
  return cout << "NO" << '\n', 0;
  return 0;
}
