favorite We need a little bit of your help to keep things running, click on this banner to learn more
Problems

# Crazy Bits

Arrnolds have invented a strange computer; it has only 12-bit registers to store numbers. And the only command that this computer accepts is SWAP. The Swap function is called with 3 parameters i, j, and d. A call of swap(i, j, d) swaps the jth bit of the ith register with its neighboring bit in direction d (0: up, 1: right, 2: down, 3: left). For example, swap (2, 3, 1) swaps the 3rd and the 4th bits of the 2nd register and Swap(6, 4, 2) swaps the 4th bits of the 6th and the 7th registers. Arrnolds know the initial values of the registers and they want to change them to some other numbers. They asked you to help them find the minimum number of swap calls.

Input

The input consists of multiple test cases. The first line of each test case is n (1n16), the number of registers. The next line contains n integers, where the ith number is the initial value of the ith register. The next line contains nintegers, where the ith number is the desired value of the ith register. The input is terminated by a line containing a zero.

Output

For each test case, you should write a single line containing the minimum number of swaps needed for that test case. If it is not possible, write "Impossible".

Time limit 1 second
Memory limit 64 MiB
Input example #1
2
2 3
6 2
3
1 1 1
2 3 4
4
5 2 6 0
3 2 2 4
0

Output example #1
3
Impossible
2