using System;
using System.Collections;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using static System.Console;
using static System.Math;
 
public class Solve{
    static public int mod = 1000000007;
    static public string al = "abcdefghijklmnopqrstuvwxyz";
    static public string bal = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
    public static void Main(){
        // 方針
        //
        /*
        var n = rint();
        var array = inta2(n,6);
        var checker = false;
        for(int i=0;i<n-1;i++){
            var a = new int[6];
            for(int k=0;k<6;k++){
                a[k] = array[i,k];
            }
            for(int j=0;j<n;j++){
                var b = new int[6];
                for(int k=0;k<6;k++){
                    b[k] = array[j,k];
                }
                if(issamedice(a,b)) checker = true;
            }
        }
        if(checker){
            WriteLine("No");
        }else{
            WriteLine("Yes");
        }
        */
        var a = inta();
        var b = inta();
        if(issamedice(a,b)){
            WriteLine("Yes");
        }else{
            WriteLine("No");
        }
	
    }
    
    
    static bool issamedice(int[] a,int[] b){
        var queue = new Queue<int>();
        for(int i=0;i<6;i++){
            if(a[0] == b[i]) queue.Enqueue(i+1);
        }
        var ret = false;
        while(queue.Count > 0){
            var north = new int[]{5,1,3,4,6,2};
            var nn = new int[]{5,1,3,4,6,2};
            var south = new int[]{2,6,3,4,1,5};
            var west = new int[]{4,2,1,6,5,3};
            var east = new int[]{3,2,6,1,5,4};
            var de = queue.Dequeue();
            var tempd = new int[6];
            for(int i=0;i<6;i++){
                tempd[i] = b[i];
            }
            if(de == 2){
                Array.Sort(north,tempd);
            }else if(de == 3){
                Array.Sort(west,tempd);
            }else if(de == 4){
                Array.Sort(east,tempd);
            }else if(de == 5){
                Array.Sort(south,tempd);
            }else if(de == 6){
                Array.Sort(north,tempd);
                Array.Sort(nn,tempd);
            }
            for(int i=0;i<4;i++){
                var check = true;
                for(int j=0;j<6;j++){
                    if(a[j] != tempd[j]){
                        check = false;
                        break;
                    }
                }
                if(check) ret = true;
                var left = new int[]{1,4,2,5,3,6};
                Array.Sort(left,tempd);
            }
        }
        return ret;
    }
    public static void swap(ref int a,ref int b){int temp = a;a= b;b = temp;}
    static void charswap(ref char a,ref char b){char temp = a;a= b;b = temp;}
    static int ncr(int n,int r){if(n<r)return 0;r = Min(r,n-r);long nn = 1;for(int i=n-r+1;i<=n;i++){nn = nn*i%mod;}long rr = 1;for(int i=1;i<=r;i++){rr = rr*i%mod;}rr = square((int)rr,mod-2);nn = nn * rr %mod;return (int)nn;}
    // a^b mod
    static int square(int a,int b){string binary = Convert.ToString(b,2);int bileng = binary.Length;long a_power = a;long value = 1;for(int i=bileng-1;i>=0;i--){if(binary[i] == '1'){value = value*a_power%mod;}a_power = a_power*a_power%mod;}return (int)value;}
    static int square2(int a,int b){long output = 1;var list = new List<long>();int sh = 1;long n = a;list.Add(a);while(sh < b){sh *= 2;n = n*n%mod;list.Add(n);}for(int i=list.Count-1;i>=0;i--){if(b > sh){b -= sh;sh /= 2;output = output*list[i]%mod;}}return (int)output;}
    //各種読取
    static string rstr(){ return ReadLine(); }
    static int rint(){ return int.Parse(ReadLine()); }
    static long rlong(){ return long.Parse(ReadLine()); }
    static string[] stra(){ return ReadLine().Split(' '); }
    static char[] chara(){ string[] a=stra();string b="";for(int i=0;i<a.Length;i++){b+=a[i];}return b.ToCharArray();}
    static int[] inta(){ string[] read_str_array = ReadLine().Split(' '); int[] return_int_array = new int[read_str_array.Length]; for(int countup_i=0;countup_i<read_str_array.Length;countup_i++){ return_int_array[countup_i] = int.Parse(read_str_array[countup_i]); } return return_int_array; }
    static int[,] inta2(int num_array,int in_array){ int[,] int_array2 = new int[num_array,in_array]; for(int i=0;i<num_array;i++){ int[] temp_array = inta(); for(int j=0;j<in_array;j++){ int_array2[i,j] = temp_array[j]; } } return int_array2; }
    static long[] longa(){ string[] read_str_array = ReadLine().Split(' '); long[] return_long_array = new long[read_str_array.Length]; for(long countup_i=0;countup_i<read_str_array.Length;countup_i++){ return_long_array[countup_i] = long.Parse(read_str_array[countup_i]); } return return_long_array; }
    static double[] doublea(){ string[] read_str_array = ReadLine().Split(' '); double[] return_double_array = new double[read_str_array.Length]; for(long countup_i=0;countup_i<read_str_array.Length;countup_i++){ return_double_array[countup_i] = double.Parse(read_str_array[countup_i]); } return return_double_array; }
    // -----------------------------
    static long divideup(long divided,long divid){ long temp_divide = divided/divid; if(divided % divid > 0){ temp_divide++; } return temp_divide; }
    static long GCD(long a,long b){ if(a < b){ long temp = a; a = b; b = temp; } if(a % b == 0){ return b; } else{ long temp = b; b = a%b; a = temp; return GCD(a,b); } }
    static long LCM(long a,long b){ return a * b / GCD(a,b); }
    static void WriteArray(int[,] a,int b,int c){for(int i=0;i<b;i++){for(int j=0;j<c;j++){if(j!=0) Write(" ");Write(a[i,j]);}WriteLine();}}
}


Measured memory_bytes: 18380