Problem:
MathJax.Hub.Config({ tex2jax: { inlineMath: [["$","$"], ["\\(","\\)"]], processEscapes: true }});

Dice III

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.

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.

Constraints

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

Sample Input 1

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

Sample Output 1

Yes

Sample Input 2

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

Sample Output 2

No

Solution in Ruby (judge verdict: Time Limit Exceeded)

d1 = gets.split.map(&:to_i)
d2 = gets.split.map(&:to_i)
dt = Array.new(6)
t = 0
f = 0
2.times do |i|
  idx = 0
  d1.each_with_index do |dir, j|
    if ((dir == d2[i]) && (d1[5-j] == d2[5-i]))
      idx = j
      break
    end
  end
  dt[i] = d1[idx]
  dt[-(i+1)] = d1[5-idx]
  t = idx + 1 if (i == 0)
  f = idx + 1 if (i == 1)
  d1[idx] = nil
  d1[5-idx] = nil
end
case t
when 1,6
  s = [2,3,5,4]
  while (s[0] != f) do
    s.unshift(s.pop)
  end
  idx = (t == 1) ? s[1] - 1 : s[-1] - 1
when 2,5
  s = [1,4,6,3]
  while (s[0] != f) do
    s.unshift(s.pop)
  end
  idx = (t == 1) ? s[1] - 1 : s[-1] - 1
when 3,4
  s = [1,2,6,5]
  while (s[0] != f) do
    s.unshift(s.pop)
  end
  idx = (t == 1) ? s[1] - 1 : s[-1] - 1
else
  puts "No"
end
dt[2] = d1[idx]
dt[3] = d1[5-idx]
puts (dt == d2) ? "Yes" : "No"