Write a program which reads the two dices constructed in the same way as Dice I, and determines whether these two dices are identical. You can roll a dice in the same way as Dice I, and if all integers observed from the six directions are the same as that of another dice, these dices can be considered as identical.

Constraints

* $0 \leq $ the integer assigned to a face $ \leq 100$

Input

In the first line, six integers assigned to faces of a dice are given in ascending order of their corresponding labels.
In the second line, six integers assigned to faces of another dice are given in ascending order of their corresponding labels.

Output

Print "Yes" if two dices are identical, otherwise "No" in a line.

Examples

Input

1 2 3 4 5 6
6 2 4 3 5 1


Output

Yes


Input

1 2 3 4 5 6
6 5 4 3 2 1


Output

No
import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
    	
    	Dice d1 = new Dice();
    	Dice d2 = new Dice();
        Scanner sc = new Scanner(System.in);
        int i, j, k;
        boolean flag = true;
        
        for(i = 0; i < 6; i++) {
        	d1.x[i] = sc.nextInt();
        }
        for(i = 0; i < 6; i++) {
        	d2.x[i] = sc.nextInt();
        }
        
        flag = comparison(d1, d2);
        if(flag == true) System.out.println("Yes");
        else System.out.println("No");
    }
    
    public static boolean comparison(Dice a, Dice b) {
    	int copy[] = new int[6];
    	boolean flag = true;
    	System.arraycopy(a.x,0,copy,0,a.x.length);
    	
    	for(int i = 0; i < 6; i++) {
    		System.arraycopy(copy,0,a.x,0,copy.length);
    		switch(i) {
    		case 1: a.roll('E'); break;
    		case 2: a.roll('S'); break;
    		case 3: a.roll('W'); break;
    		case 4: a.roll('N'); break;
    		case 5: a.roll('E'); a.roll('E'); break;
    		}
    		for(int j = 0; j < 4; j++) {
    			int tmp;
    	    	tmp = a.x[1];
    	    	a.x[1] = a.x[2];
    	    	a.x[2] = a.x[4];
    	    	a.x[4] = a.x[3];
    	    	a.x[3] = tmp;
    	    	
    	    	/*
    	     	for(int k = 0; k < 6; k++) {
    	    		System.out.println(a.x[k] + " " + b.x[k]);
    	    	}
    	    	*/
    	    	
    			for(int k = 0; k < 6; k++) {
        			if(a.x[k] != b.x[k]) flag = false;
        		}
    			
    			if(flag == true) return true;
    			else flag = true;
    		}
    	}
    	return false;
    }
    
    
    public static int solve(int a, int b, int dice[]) {
    	int ans = -1;
    	if(a == dice[0] || a == dice[5])
    		if(b == dice[1]) 
    			ans = dice[2];
    		else if(b == dice[2]) 
    			ans = dice[4];
    		else if(b == dice[4]) 
    			ans = dice[3];
    		else
    			ans = dice[1];
    	else if(a == dice[1] || a == dice[4])
    		if(b == dice[2])
    			ans = dice[0];
    		else if(b == dice[0])
    			ans = dice[3];
    		else if(b == dice[3])
    			ans = dice[5];
    		else
    			ans = dice[2];
    	else if(a == dice[2] || a == dice[3])
    		if(b == dice[0])
    			ans = dice[1];
    		else if(b == dice[1])
    			ans = dice[5];
    		else if(b == dice[5])
    			ans = dice[4];
    		else
    			ans = dice[0];
    	
    	if(a == dice[5])
    		ans = dice[0] + dice[5] - ans;
    	else if(a == dice[4])
    		ans = dice[0] + dice[5] - ans;
    	else if(a == dice[3])
    		ans = dice[0] + dice[5] - ans;
    	
    	return ans;
    }
}


class Dice{
	public int x[] = new int[6];
	int tmp1, tmp2;
	
	public void roll(char direction) {
		switch(direction) {
		case 'E':
			tmp1 = x[0];
    		x[0] = x[3];
    		tmp2 = x[2];
    		x[2] = tmp1;
    		tmp1 = x[5];
    		x[5] = tmp2;
    		x[3] = tmp1;
    		return;
    		
		case 'S':
			tmp1 = x[0];
    		x[0] = x[4];
    		tmp2 = x[1];
    		x[1] = tmp1;
    		tmp1 = x[5];
    		x[5] = tmp2;
    		x[4] = tmp1;
    		return;
		
		case 'W':
			tmp1 = x[0];
    		x[0] = x[2];
    		tmp2 = x[3];
    		x[3] = tmp1;
    		tmp1 = x[5];
    		x[5] = tmp2;
    		x[2] = tmp1;
    		return;
    		
		case 'N':
			tmp1 = x[0];
    		x[0] = x[1];
    		tmp2 = x[4];
    		x[4] = tmp1;
    		tmp1 = x[5];
    		x[5] = tmp2;
    		x[1] = tmp1;
    		return;
		}
	}
}

