#include <bits/stdc++.h>
using namespace std;
const int N = 3;
vector<vector<char> > start, mustget;
vector<pair<int, int> > go = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
bool flag = false;
bool good(int x, int y) {
  if (x < 0 || x >= 2) return false;
  if (y < 0 || y >= 2) return false;
  return true;
}
bool eq(vector<vector<char> > one, vector<vector<char> > two) {
  for (int i = 0; i < (int)(2); ++i) {
    for (int j = 0; j < (int)(2); ++j) {
      if (one[i][j] != two[i][j]) return false;
    }
  }
  return true;
}
void dfs(vector<vector<char> > parent, vector<vector<char> > current) {
  if (eq(current, mustget)) {
    flag = true;
    return;
  }
  for (int i = 0; i < (int)(2); ++i) {
    for (int j = 0; j < (int)(2); ++j) {
      if (current[i][j] == 'X') {
        for (auto to : go) {
          vector<vector<char> > want = current;
          if (good(i + to.first, j + to.second)) {
            swap(want[i][j], want[i + to.first][j + to.second]);
            if (!eq(want, start) && !eq(want, parent)) dfs(current, want);
          }
        }
      }
    }
  }
}
int main() {
  start.resize(N);
  for (int i = 0; i < (int)(2); ++i) {
    start[i].resize(N);
    for (int j = 0; j < (int)(2); ++j) {
      cin >> start[i][j];
    }
  }
  mustget.resize(N);
  for (int i = 0; i < (int)(2); ++i) {
    mustget[i].resize(N);
    for (int j = 0; j < (int)(2); ++j) {
      cin >> mustget[i][j];
    }
  }
  dfs(start, start);
  if (flag)
    cout << "YES";
  else
    cout << "NO";
  return 0;
}
