A logistics yard is laid out as an n x n grid of storage cells. Each cell (i, j) holds a vertical stack of unit-cube crates, v[i][j] crates tall (a stack may be empty). Before shipping, the yard crew shrink-wraps every exposed face of every crate: the top of the tallest crate in a stack, the bottom of the lowest crate (crates sit directly on the yard floor, and that bottom face still needs wrap), and every side face that is not pressed against another crate of at least the same height in an adjacent stack (front, back, left, right). Two side-by-side stacks that touch shield each other's facing walls up to whichever stack is shorter; the part of the taller stack that rises above that shared height is still exposed and needs wrap on that side. Given the grid of stack heights, find the total area, in unit squares, of shrink-wrap material required to cover every exposed face of every crate in the yard.

Input format

• Line 1: a single integer n, the size of the grid.
• Each of the next n lines contains n space-separated integers: row i of the grid, v[i][0] ... v[i][n-1].

Output format

• A single integer: the total exposed surface area, in unit squares.

Constraints

• 1 <= n <= 50
• 0 <= v[i][j] <= 50

1
2

10

2
1 2
3 4

34