import java.util.*;
import java.io.*;

public class Main {

	void solve (FastScanner in, PrintWriter out, Methods ms) {
		
		Dice d1 = new Dice(in.nextInt(), in.nextInt(), in.nextInt(),
							in.nextInt(), in.nextInt(), in.nextInt());
		
		Dice d2 = new Dice(in.nextInt(), in.nextInt(), in.nextInt(),
				in.nextInt(), in.nextInt(), in.nextInt());
		
		out.println(isSameDice(d1, d2)==true? "Yes" : "No");
		
	}
	
	static boolean isSameDice (Dice d1, Dice d2) {
	
		for (int i=0; i<6; i++) {
	
			for (int k=0; k<pattern[i].length(); k++) {
				if (pattern[i].charAt(k) == 'N') d2.turnN();
				else if (pattern[i].charAt(k) == 'E') d2.turnE();
			}
	
			for (int j=0; j<4; j++) {
				d2.turnRight();
				if (d1.U==d2.U && d1.S==d2.S && d1.E==d2.E &&
					d1.W==d2.W && d1.N==d2.N && d1.D==d2.D)
				{
					return true;
				}
			}
	
		}
	
		return false;
		
	}
	
	static String[] pattern = {"", "N", "N", "N", "E", "EE"};
	
	
	
	static class Dice {
	
		int U, D, N, E, S, W, temp;
	
		Dice (int u, int s, int e, int w, int n, int d) {
			U = u; S = s; E = e; W = w; N = n; D = d;
		}
	
		void turnN () {
			temp = D;
			D = N; N = U; U = S; S = temp;
		}
		void turnE () {
			temp = W;
			W = D; D = E; E = U; U = temp;
		}
		void turnS () {
			temp = D;
			D = S; S = U; U = N; N = temp;
		}
		void turnW () {
			temp = W;
			W = U; U = E; E = D; D = temp;
		}
		void turnRight () {
			temp = W;
			W = S; S = E; E = N; N = temp;
		}
		void turnLeft () {
			temp = W;
			W = N; N = E; E = S; S = temp;
		}
	}


	public static void main(String[] args) {
		Main main = new Main();
		FastScanner in = new FastScanner(System.in);
		PrintWriter out = new PrintWriter(System.out);
		Methods ms = new Methods();
		main.solve(in, out, ms);
		in.close();
		out.close();
	}

	static class Methods {

		public void print (Object... ar) {System.out.println(Arrays.deepToString(ar));}

		public void yesno (PrintWriter out, boolean b) {out.println(b?"Yes":"No");}

		public void YESNO (PrintWriter out, boolean b) {out.println(b?"YES":"NO");}

		public int max (int... ar) {Arrays.sort(ar); return ar[ar.length-1];}

		public int min (int... ar) {Arrays.sort(ar); return ar[0];}

	}

	static class FastScanner {

		private InputStream in;
		private byte[] buffer = new byte[1024];
		private  int length = 0, p = 0;

		public FastScanner (InputStream stream) {
			in = stream;
		}

		public boolean hasNextByte () {
			if (p < length) return true;
			else {
				p = 0;
				try {length = in.read(buffer);}
				catch (Exception e) {e.printStackTrace();}
				if (length <= 0) return false;
			}
			return true;
		}

		public int readByte () {
			if (hasNextByte() == true) return buffer[p++];
			return -1;
		}

		public boolean isPrintable (int n) {return 33<=n&&n<=126;}

		public void skip () {
			while (hasNextByte() && !isPrintable(buffer[p])) p++;
		}

		public boolean hasNext () {skip(); return hasNextByte();}

		public String next () {
			if (!hasNext()) throw new NoSuchElementException();
			StringBuilder sb = new StringBuilder();
			int t = readByte();
			while (isPrintable(t)) {
				sb.appendCodePoint(t);
				t = readByte();
			}
			return sb.toString();
		}

		public String[] nextArray (int n) {
			String[] ar = new String[n];
			for (int i=0; i<n; i++) ar[i] = next();
			return ar;
		}

		public int nextInt () {return Math.toIntExact(nextLong());}

		public int[] nextIntArray (int n) {
			int[] ar = new int[n];
			for (int i=0; i<n; i++) ar[i] = nextInt();
			return ar;
		}

		public long nextLong () {
			if (!hasNext()) throw new NoSuchElementException();
			boolean minus = false;
			int temp = readByte();
			if (temp == '-') {
				minus = true;
				temp = readByte();
			}
			if (temp<'0' || '9'<temp) throw new NumberFormatException();
			long n = 0;
			while (isPrintable(temp)) {
				if ('0'<=temp && temp<='9') {
					n *= 10;
					n += temp - '0';
				}
				else throw new NumberFormatException();
				temp = readByte();
			}
			return minus? -n : n;
		}

		public long[] nextLongArray (int n) {
			long[] ar = new long[n];
			for (int i=0; i<n; i++) ar[i] = nextLong();
			return ar;
		}

		public double nextDouble () {
			return Double.parseDouble(next());
		}

		public double[] nextDoubleArray (int n) {
			double[] ar = new double[n];
			for (int i=0; i<n; i++) ar[i] = nextDouble();
			return ar;
		}

		public void close () {
			try {in.close();}
			catch(Exception e){}
		}

	}

}


Measured memory_bytes: 24480