You have a n x n board and several checkers placed on it. The i-th checker is in the cell at row x[i], column y[i]. All coordinates are 1-based. There can be more than one checker in the same cell. A move consists of taking one checker and moving it one cell up, down, left or right.
You want to put each checker in one of the four corners of the board. Return the minimum number of moves necessary to achieve the goal.
|-||n will be between 1 and 100, inclusive.|
|-||x will contain between 1 and 50 elements, inclusive.|
|-||y will contain the same number of elements as x.|
|-||Each element of x will be between 1 and n, inclusive.|
|-||Each element of y will be between 1 and n, inclusive.|