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

using i64 = long long;

const int L = 100, N = L * L + 5;

const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};

struct Edge {
	int u, v, cap, flow; };

vector<int> g[N];
int far[N], f[N], a[L][L], b[L][L];

vector<Edge> edges;
int n, ant, src, snk;

static char nextch() {
	const int BMAX = 1 << 16;
	static char buff[BMAX];
	static int bp(BMAX);

	if (bp == BMAX) {
		fread(buff, 1, BMAX, stdin);
		bp = 0; }

	return buff[ bp++ ]; }

static void get(int &arg) {
	char ch;

	do {
		ch = nextch(); }
	while (ch < '0');
	arg = 0;
	do {
		arg = arg * 10 + ch - '0';
		ch = nextch(); }
	while (ch >= '0'); }


static void make_edg(int u, int v, int cap) {
	g[u].push_back(edges.size()); edges.push_back({u, v, cap, 0});
	g[v].push_back(edges.size()); edges.push_back({v, u, cap, 0}); }

static bool pump() {
	static int tid = 0; ++tid;
	static deque<int> dq;
	int u, cap;

	dq.push_back(src);
	f[src] = tid;
	while (!dq.empty()) {
		u = dq.front();
		dq.pop_front();

		for (auto v: g[u]) if (edges[v].cap - edges[v].flow > 0 && f[edges[v].v] != tid) {
			dq.push_back(edges[v].v);
			far[edges[v].v] = v;
			f[edges[v].v] = tid; } }

	if (f[snk] == tid)
	for (auto v: g[snk]) if (f[edges[v^= 1].u] == tid) {
		u = edges[v].u;
		cap = edges[v].cap - edges[v].flow;
		
		while (u != src && cap > 0) {
			cap = min(cap, edges[far[u]].cap - edges[far[u]].flow);
			u = edges[far[u]].u; }

		ant-= cap;
		if (!cap)
			continue;

		u = edges[v].u;
		edges[v].flow+= cap;
		edges[v ^ 1].flow-= cap;

		while (u != src) {
			edges[far[u]].flow+= cap;
			edges[far[u] ^ 1].flow-= cap;
			u = edges[far[u]].u; } }

	return f[snk] == tid; }

static inline bool ok(int x, int y) {
	return (0 <= x && x < n) && (0 <= y && y < n); }

static inline int cod(int x, int y) {
	return x * n + y; }

int main() {
	freopen("pixels.in", "r", stdin);
	freopen("pixels.out", "w", stdout);

	int nx, ny, t;

	get(n);
	for (int i = 0; i < n; ++i)
	for (int j = 0; j < n; ++j)
		get(a[i][j]),
		ant+= a[i][j];

	for (int i = 0; i < n; ++i) 
	for (int j = 0; j < n; ++j)
		get(b[i][j]),
		ant+= b[i][j];

	src = n * n + 2;
	snk = n * n + 3;

	edges.reserve(L * L * 20);
	for (int i = 0; i < n; ++i)
	for (int j = 0; j < n; ++j) {
		make_edg(src, cod(i, j), a[i][j]);
		make_edg(snk, cod(i, j), b[i][j]);
		for (int d = 0; d < 4; ++d) {
			get(t);

			nx = i + dx[d];
			ny = j + dy[d];

			if (ok(nx, ny) && (i + j) % 2)
				make_edg(cod(i, j), cod(nx, ny), t); } }

	while (pump());

	printf("%d\n", ant);

	return 0; }