#include <iostream>
#include <iomanip>

void inArray(int** arr, int size);
void outArray(int** arr, int size);
int findLocalMin(int** arr, int size);

int main()
{
	int size;
	std::cin >> size;
	int** arr = new int* [size];
	for (int i = 0; i < size; i++)
	{
		arr[i] = new int[size];
	}
	inArray(arr, size);
	outArray(arr, size);
	std::cout << findLocalMin(arr, size);
	return 0;
}


void inArray(int** arr, int size)
{
	for (int i = 0; i < size; i++)
	{
		for (int j = 0; j < size; j++)
		{
			std::cin >> arr[i][j];
		}
	}
}
void outArray(int** arr, int size)
{
	for (int i = 0; i < size; i++)
	{
		for (int j = 0; j < size; j++)
		{
			std::cout << std::setw(2) << arr[i][j];
		}
		std::cout << std::endl;
	}
}
int findLocalMin(int** arr, int size)
{
	int k = 0;
	for (int i = 0; i < size; i++)
	{
		for (int j = 0; j < size; j++)
		{
			if (size == 1)
			{
				k++;
			}
			else if (i == 0)
			{
				if (j == 0)
				{
					if ((arr[i][j] < arr[i][j + 1]) && (arr[i][j] < arr[i + 1][j]) && (arr[i][j] < arr[i + 1][j + 1]))
						k++;
				}
				else if (j == size - 1)
				{
					if ((arr[i][j] < arr[i][j - 1]) && (arr[i][j] < arr[i + 1][j]) && (arr[i][j] < arr[i + 1][j - 1]))
						k++;
				}
				else
				{
					if ((arr[i][j] < arr[i][j - 1]) && (arr[i][j] < arr[i + 1][j - 1]) && (arr[i][j] < arr[i + 1][j]) && (arr[i][j] < arr[i + 1][j + 1]) && (arr[i][j] < arr[i][j + 1]))
						k++;
				}
			}
			else if (i == size - 1)
			{
				if (j == 0)
				{
					if ((arr[i][j] < arr[i - 1][j]) && (arr[i][j] < arr[i - 1][j + 1]) && (arr[i][j] < arr[i][j + 1]))
						k++;
				}
				else if (j == size - 1)
				{
					if ((arr[i][j] < arr[i][j - 1]) && (arr[i][j] < arr[i - 1][j - 1]) && (arr[i][j] < arr[i - 1][j]))
						k++;
				}
				else
				{
					if ((arr[i][j] < arr[i][j - 1]) && (arr[i][j] < arr[i - 1][j - 1]) && (arr[i][j] < arr[i - 1][j]) && (arr[i][j] < arr[i - 1][j + 1]) && (arr[i][j] < arr[i][j + 1]))
						k++;
				}
			}
			else
			{
				if (j == 0)
				{
					if ((arr[i][j] < arr[i - 1][j]) && (arr[i][j] < arr[i - 1][j + 1]) && (arr[i][j] < arr[i][j + 1]) && (arr[i][j] < arr[i + 1][j + 1]) && (arr[i][j] < arr[i + 1][j]))
						k++;
				}
				else if (j == size - 1)
				{
					if ((arr[i][j] < arr[i - 1][j]) && (arr[i][j] < arr[i - 1][j - 1]) && (arr[i][j] < arr[i][j - 1]) && (arr[i][j] < arr[i + 1][j - 1]) && (arr[i][j] < arr[i + 1][j]))
						k++;
				}
				else
				{
					if ((arr[i][j] < arr[i - 1][j - 1]) && (arr[i][j] < arr[i - 1][j]) && (arr[i][j] < arr[i - 1][j + 1]) && (arr[i][j] < arr[i][j + 1]) && (arr[i][j] < arr[i + 1][j + 1]) && (arr[i][j] < arr[i + 1][j]) && (arr[i][j] < arr[i + 1][j]) && (arr[i][j] < arr[i][j - 1]))
						k++;
				}
			}
		}

	}
	return k;
}