#### Start

2017-11-26 10:30 UTC

## NWERC 2017 Open Contest

#### End

2017-11-26 15:30 UTC
The end is near!
Contest is over.
Not yet started.
Contest is starting in -483 days 23:12:40

5:00:00

0:00:00

# Problem CConnect the Dots

A famous logical problem is that of connecting 9 dots on a paper by drawing 4 line segments with a pencil, while never lifting the pencil from the paper. While this is easy enough (although it requires some thinking outside of the box), Simone has recently been building a game called “Connect the Dots” around a generalisation of the concept.

In Connect the Dots, you are presented with a $4 \times 4$ regular grid of dots. Each dot is given a unique number between $1$ and $16$. The task is then to connect the dots in order by their numbers, starting with dot $1$ and ending with dot $16$. The dots should be connected using as few line segments as possible, starting at dot $1$, with the end of each segment being the start point of the next. The segments are allowed to intersect and overlap one another. Additionally, it is allowed to pass through other points while trying to connect the current point. This means, for example, that visiting the first four points in the order $1, 4, 2, 3, 2, 4, \dots$ is acceptable. Formally, the sequence $1, 2, \dots , 15, 16$ must be a subsequence of the sequence of dots visited. Figure 1: A solution to the first sample.

Simone asked you to try the puzzle out, while betting you a balloon that it would be too hard. Prove her wrong by writing a program that solves the puzzle for you!

## Input

The input consists of:

• $4$ lines, each with $4$ integers, the numbers of the dots in the grid. The $j$th number on the $i$th line is the number of the $j$th dot in the $i$th row of the grid of dots.

The $16$ numbers in the input are all between $1$ and $16$ (inclusive) and pairwise distinct.

## Output

Output the minimum number of line segments needed to connect all the dots in order.

Sample Input 1 Sample Output 1
1 2 3 4
10 11 12 5
9 16 6 13
8 7 15 14

6

Sample Input 2 Sample Output 2
1 2 3 4
8 9 10 11
7 15 16 12
6 14 13 5

7