#include <bits/stdc++.h>
using namespace std;

const int N = 60;
int n, h[N][N], sum, a[N*N], b[N*N], tot, ans = INT_MAX, cnt, qx, qy;
bool f[N][N];
int dx[] = {1, 1, 1, 0, 0, -1, -1, -1};
int dy[] = {1, 0, -1, 1, -1, 1, 0, -1};
string s[N];
void dfs(int x, int y, int start, int last)
{
	for (int i = 0; i < 8; i++)
	{
		int xx = x + dx[i];
		int yy = y + dy[i];
		if (xx < 0 || yy < 0 || xx >= n || yy >= n)
		{
			continue;
		}
		if (f[xx][yy] || h[xx][yy] > a[last] || h[xx][yy] < a[start])
		{
			continue;
		}
		f[xx][yy] = 1;
		if (s[xx][yy] == 'K')
		{
			cnt++;
		}
		dfs(xx, yy, start, last);
	}
}

signed main()
{
	ios::sync_with_stdio();
	cin.tie(0);cout.tie(0);
	cin >> n;
	for (int i = 0; i < n; i++)
	{
		cin >> s[i];
		for (int j = 0; j < n; j++)
		{
			if (s[i][j] == 'K')
			{
				sum++;
			}
			if (s[i][j] == 'P')
			{
				qx = i, qy = j;
			}
		}
	}
	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < n; j++)
		{
			cin >> h[i][j];
			b[++tot] = h[i][j];
		}
	}
	sort(b + 1, b + 1 + tot);
	int tot2 = 0;
	for (int i = 1; i <= tot; i++)
	{
		if (b[i] != b[i-1])
		{
			a[++tot2] = b[i];
		}
	}
	tot = tot2;
	for (int start = 1; start <= tot; start++)
	{
		int left = start, right = tot;
		bool flag = 0;
		while (left <= right)
		{
			int mid = (left + right) / 2;
			cnt = 0;
			memset(f, 0, sizeof(f));
			f[qx][qy] = 1;
			dfs(qx, qy, start, mid);
			if (cnt == sum)
			{
				right = mid - 1;
				flag = 1;
				ans = min(ans, a[mid] - a[start]);
			}
			else
			{
				left = mid + 1;
			}
		}
	}
	cout << ans;
	return 0;
}

WA了3个点