Pavement

//elab-source: TaweeOne.java
import java.util.Scanner;

public class TaweeOne {

    public static boolean checkAround(int[][] mountain, int x, int y, int i) {
        boolean check = false;
        for (int row = 0; row < mountain.length; row++) {
            for (int column = 0; column < mountain.length; column++) {
                if (mountain[row][column] == i + 1) {
                if (column == x - 1 && row == y || column == x + 1 && row == y|| column == x && row == y + 1 || column == x&& row == y - 1) {
                        check = true;
                    }
                }
            }
        }
        return check;
    }

    public static int newX(int[][] mountain, int i) {
        int newX = 0;
        for (int row = 0; row < mountain.length; row++) {
            for (int column = 0; column < mountain.length; column++) {
                if (mountain[row][column] == i) {
                    newX = column;
                }
            }
        }
        return newX;
    }

    public static int newY(int[][] mountain, int i) {
        int newY = 0;
        for (int row = 0; row < mountain.length; row++) {
            for (int column = 0; column < mountain.length; column++) {
                if (mountain[row][column] == i) {
                    newY = row;
                }
            }
        }
        return newY;
    }

    public static int detectX(int[][] mountain) {
        int x = 0;
        for (int i = 0; i < mountain.length; i++) {
            for (int k = 0; k < mountain.length; k++) {
                if (mountain[i][k] == 1) {
                    x = k;
                }
            }
        }
        return x;
    }

    public static int detectY(int[][] mountain) {
        int y = 0;
        for (int i = 0; i < mountain.length; i++) {
            for (int k = 0; k < mountain.length; k++) {
                if (mountain[i][k] == 1) {
                    y = i;
                }
            }
        }
        return y;
    }

    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        int n = scan.nextInt();
        int[][] mountain = new int[n][n];
        for (int i = 0; i < mountain.length; i++) {
            for (int j = 0; j < mountain.length; j++) {
                mountain[i][j] = scan.nextInt();
            }
        }

        int x = detectX(mountain);
        int y = detectY(mountain);

        for (int i = 1; i <= n*n; i++) {
            if (i != 1) {
                x = newX(mountain, i);
                y = newY(mountain, i);
            }
            if (!checkAround(mountain, x, y, i)) {
                System.out.println(i);
                break;
            }

        }

    }
}