There are 2 special dices on the table. On each face of the dice, a distinct number was written. Consider a_{1}.a_{2},a_{3},a_{4},a_{5},a_{6} to be numbers written on top face, bottom face, left face, right face, front face and back face of dice A. Similarly, consider b_{1}.b_{2},b_{3},b_{4},b_{5},b_{6} to be numbers on specific faces of dice B. It’s guaranteed that all numbers written on dices are integers no smaller than 1 and no more than 6 while a_{i} ≠ a_{j} and b_{i} ≠ b_{j} for all i ≠ j. Specially, sum of numbers on opposite faces may not be 7.

At the beginning, the two dices may face different(which means there exist some i, a_{i} ≠ b_{i}). Ddy wants to make the two dices look the same from all directions(which means for all i, a_{i} = b_{i}) only by the following four rotation operations.(Please read the picture for more information)

Now Ddy wants to calculate the minimal steps that he has to take to achieve his goal.

At the beginning, the two dices may face different(which means there exist some i, a

Now Ddy wants to calculate the minimal steps that he has to take to achieve his goal.

There are multiple test cases. Please process till EOF.

For each case, the first line consists of six integers a_{1},a_{2},a_{3},a_{4},a_{5},a_{6}, representing the numbers on dice A.

The second line consists of six integers b_{1},b_{2},b_{3},b_{4},b_{5},b_{6}, representing the numbers on dice B.

For each case, the first line consists of six integers a

The second line consists of six integers b

提交代码