(CROC 2016 - Elimination Round (Rated Unofficial Edition))A. Amity Assessment（贪心）

A. Amity Assessment

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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:

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 a2 × 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...

题意：
问四方格中的初始状态是否能变成指定状态。
贪心。。。。如果不断交换X和与X相邻的字母，直到两种状态的第一行字母相同就YES，else NO。

#include<bits/stdc++.h>
using namespace std;
int f[2][2], s[2][2];
string s1, s2, s3, s4;
int main(){
	cin >> s1 >> s2;
	swap(s2[0], s2[1]);
	s1 += s2;
	cin >> s3 >> s4;
	swap(s4[0], s4[1]);
	s3 += s4;
	int cnt = 41;
	while(cnt--){
		for(int i=0;i<4;++i){
			if(s1[i] == 'X'){
				swap(s1[i], s1[(i+1)%4]);//交换X和与X相邻的字母 
				break;
			}
		}
	//如果初始状态的第一行与终点状态的第一行一样，就肯定可以啦
		if(s1 == s3){      
				printf("YES\n");
				return 0;
			}
	}

	printf("NO\n");

	return 0;
}