#include <bits/stdc++.h>
using namespace std;
int n, m, h, c, k, tong, dem, vt, kq, dai;
int a[1111], b[111];
char s[5][5], ss[5][5];
char z[111], zz[111], ch[111];
void sol() {
  int i, j, cs, dd;
  strcpy(z, s[0]);
  strcpy(zz, ss[0]);
  dd = 0;
  cs = 0;
  for (i = 0; i < 2; i++) {
    if (s[0][i] != 'X') z[dd++] = s[0][i];
    if (ss[0][i] != 'X') zz[cs++] = ss[0][i];
  }
  for (i = 1; i >= 0; i--) {
    if (s[1][i] != 'X') z[dd++] = s[1][i];
    if (ss[1][i] != 'X') zz[cs++] = ss[1][i];
  }
  for (i = 0; i < 3; i++) {
    if (zz[i] == z[0]) {
      vt = i;
      break;
    }
  }
  j = vt;
  dem = 1;
  i = 1;
  while (i < 3) {
    j++;
    if (j >= 3) j = 0;
    if (zz[j] != z[i]) {
      cout << "NO\n";
      return;
    }
    i++;
  }
  cout << "YES\n";
}
int main() {
  int i, j;
  while (scanf("%s %s %s %s", &s[0], &s[1], &ss[0], &ss[1]) > 0) {
    sol();
  }
  return 0;
}
