Problem: Bessie the cow and her best friend Elsie each received a sliding puzzle on Pi Day. Their puzzles consist of a 2 × 2 grid and three tiles labeled 'A', 'B', and 'C'. The three tiles sit on top of the grid, leaving one grid cell empty. To make a move, Bessie or Elsie can slide a tile adjacent to the empty cell into the empty cell as shown below:

<image>

In order to determine if they are truly Best Friends For Life (BFFLs), Bessie and Elsie would like to know if there exists a sequence of moves that takes their puzzles to the same configuration (moves can be performed in both puzzles). Two puzzles are considered to be in the same configuration if each tile is on top of the same grid cell in both puzzles. Since the tiles are labeled with letters, rotations and reflections are not allowed.

Input

The first two lines of the input consist of a 2 × 2 grid describing the initial configuration of Bessie's puzzle. The next two lines contain a 2 × 2 grid describing the initial configuration of Elsie's puzzle. The positions of the tiles are labeled 'A', 'B', and 'C', while the empty cell is labeled 'X'. It's guaranteed that both puzzles contain exactly one tile with each letter and exactly one empty position.

Output

Output "YES"(without quotes) if the puzzles can reach the same configuration (and Bessie and Elsie are truly BFFLs). Otherwise, print "NO" (without quotes).

Examples

Input

AB
XC
XB
AC


Output

YES


Input

AB
XC
AC
BX


Output

NO

Note

The solution to the first sample is described by the image. All Bessie needs to do is slide her 'A' tile down.

In the second sample, the two puzzles can never be in the same configuration. Perhaps Bessie and Elsie are not meant to be friends after all...

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
int main() {
  string s1, s2, s3, s4;
  cin >> s1 >> s2 >> s3 >> s4;
  int i = 0;
  int x = 0, k = 0;
  for (int i = 0; i < 2; ++i)
    if (s1[i] == 'X') x = 1, k = i;
  for (int i = 0; i < 2; ++i)
    if (s2[i] == 'X') x = 2, k = i;
  while (1) {
    if (s1[0] == s3[0] && s1[1] == s3[1] && s1[0] != 'X' && s3[0] != 'X' &&
        s1[1] != 'X' && s3[1] != 'X')
      break;
    if (s1[0] == s3[0] && s2[0] == s4[0] && s1[0] != 'X' && s3[0] != 'X' &&
        s2[0] != 'X' && s4[0] != 'X')
      break;
    if (s1[1] == s3[1] && s2[1] == s4[1] && s1[1] != 'X' && s3[1] != 'X' &&
        s2[1] != 'X' && s4[1] != 'X')
      break;
    if (s2[0] == s4[0] && s2[1] == s4[1] && s2[0] != 'X' && s4[0] != 'X' &&
        s1[1] != 'X' && s4[1] != 'X')
      break;
    if (i == 1000) {
      puts("NO");
      return 0;
    }
    if (x == 1 || x == 2) {
      if (x == 1) swap(s1[k], s1[1 - k]);
      if (x == 2) swap(s2[k], s2[1 - k]);
      k = 1 - k;
      x = 3;
    } else {
      swap(s2[k], s1[k]);
      if (s2[k] == 'X')
        x = 2;
      else
        x = 1;
    }
    i++;
  }
  puts("YES");
  return 0;
}