import java.util.Scanner;
public class Peak {
int[] dx = {-1, 0, 1, 0};
int[] dy = {0, 1, 0, -1};
public int solution(int n, int[][] arr){
int answer=n*n;
for (int i=0;i=0 && nx < n && ny>=0 && ny < n && arr[nx][ny] >= arr[i][j]){
answer--;
break;
}
}
}
}
return answer;
}
public static void main(String[] args) {
Peak t = new Peak();
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
int[][] arr = new int[n][n];
for (int i=0;i