Problem Statement

You are given a positive integer $N$.
We have a grid with $N$ rows and $N$ columns, where the square at the $i$-th row from the top and $j$-th column from the left has a digit A_{i,j}Ai,j written on it.
Assume that the upper and lower edges of this grid are connected, as well as the left and right edges. In other words, all of the following holds.

• $(N,i)$ is just above $(1,i)$, and $(1,i)$ is just below $(N,i)$. $(1\le i\le N)$.
• $(i,N)$ is just to the left of $(i,1)$, and $(i,1)$ is just to the right of $(i,N)$. $(1\le i\le N)$.

Takahashi will first choose one of the following eight directions: up, down, left, right, and the four diagonal directions. Then, he will start on a square of his choice and repeat moving one square in the chosen direction $N-1$ times.
In this process, Takahashi visits $N$ squares. Find the greatest possible value of the integer that is obtained by arranging the digits written on the squares visited by Takahashi from left to right in the order visited by him.

Constraints

• $1\le N\le 10$
• 1 \le A_{i,j} \le 91≤Ai,j≤9
• All values in input are integers.

$N$A_{1,1}A_{1,2}\dots A_{1,N}A1,1A1,2…A1,NA_{2,1}A_{2,2}\dots A_{2,N}A2,1A2,2…A2,N$⋮$A_{N,1}A_{N,2}\dots A_{N,N}AN,1AN,2…AN,N