题面及数据范围
The Olympic Games will be held in JOI Kingdom soon. In order to welcome participants from all over the world, the buildings on the way from the airport to the accommodation will be decorated. There are 2 N 2N 2N buildings, numbered from 1 1 1 to 2 N 2N 2N from the airport.
President K is in charge of the decoration project. He asked the public to make decoration plans. After examining them, he finally chose two plans, the plan A and the plan B. In the plan A, the luxury level of the building i i i ( 1 ⩽ i ⩽ 2 N 1 \leqslant i \leqslant 2N 1⩽i⩽2N) is A i A_i Ai. In the plan B, the luxury level of the building i i i ( 1 ⩽ i ⩽ 2 N 1 \leqslant i \leqslant 2N 1⩽i⩽2N) is B i B_i Bi.
Both plans are very good, and it is difficult to choose one of them. He decided to decorate the buildings in the following way: for each building, one of the plan A or B will be chosen. In order to decorate the buildings in a fair way, the plan A will be chosen for N buildings, and the plan B will be chosen for the remaining N buildings.
Moreover, since the participants will be excited if the luxury levels are increasing on the way from the airport to the accommodation, the following condition should be satisfied: C i ⩽ C i + 1 C_i \leqslant C_{i+1} Ci⩽Ci+1for every i i i with 1 ⩽ i ⩽ 2 N − 1 1 \leqslant i \leqslant 2N - 1 1⩽i⩽2N−1, where C i