봉우리

 

import java.util.Scanner;

class Main {
	
	
	
	static int []dx = {-1, 0 , 1 , 0};
	static int []dy = {0, -1 , 0 , 1};
	static int answer =0;
	public static void main ( String args[]) throws Exception
	{
	
		Scanner in = new Scanner(System.in);
		
		int n = in.nextInt();
		int [][]arr =  new int[n][n];
		for ( int i = 0 ; i < n ; i++) {
			for (int j = 0 ; j < n ; j++) {				
				arr[i][j] = in.nextInt();
			}
		}

		
		for ( int i = 0 ; i < n ; i++) {
			for (int j = 0 ; j < n ; j++) {
				boolean isPeak=true;				
				for ( int k = 0 ; k < 4 ; k ++) {
				
					int nx = i + dx[k];
					int ny = j + dy[k];
					
					if ( nx >= 0 && nx < n && ny >= 0 && ny < n &&
							arr[nx][ny] >= arr[i][j] ) { 
						isPeak=false;
						break;
					}
				
				}
				if( isPeak == true)
					answer++;
			}
		}
	
		System.out.println(answer);
	}

}