#include <iostream>
#include <cstdio>
#include <cstring>
#include <queue>
#define int long long
using namespace std;
const int N=1e6+10;
const int M=5e6+10;
int n,dis[N],mk[N],ver[N],S,T;
int to[M],nxt[M],val[M],idx;
priority_queue<pair<int,int>>q;
void add(int x,int y,int z){
	to[++idx]=y,nxt[idx]=ver[x],ver[x]=idx,val[idx]=z;
}
int id(int i,int j){
	if(i>n||j<1)return S;
	if(i<1||j>n)return T;
	return (i-1)*n+j;
}
signed main(){
	freopen("altitude.in","r",stdin);
	freopen("altitude.out","w",stdout); 
	scanf("%lld",&n);
	S=n*n+1,T=n*n+2;
	for(int i=1;i<=n+1;i++){
		for(int j=1,w;j<=n;j++){
			scanf("%lld",&w);
			add(id(i,j),id(i-1,j),w);
		}
	}
	for(int i=1;i<=n;i++){
		for(int j=1,w;j<=n+1;j++){
			scanf("%lld",&w);
			add(id(i,j-1),id(i,j),w);
		}
	}
	for(int i=1;i<=n+1;i++){
		for(int j=1,w;j<=n;j++){
			scanf("%lld",&w);
			add(id(i-1,j),id(i,j),w);
		}
	}
	for(int i=1;i<=n;i++){
		for(int j=1,w;j<=n+1;j++){
			scanf("%lld",&w);
			add(id(i,j),id(i,j-1),w);
		}
	}
	memset(dis,0x3f,sizeof(dis));
	dis[S]=0;q.push(make_pair(0,S));
	while(q.size()){
		int x=q.top().second;q.pop();
		if(mk[x])continue;mk[x]=1;
		for(int i=ver[x];i;i=nxt[i]){
			int y=to[i];
			if(dis[y]>dis[x]+val[i]){
				dis[y]=dis[x]+val[i];
				q.push(make_pair(-dis[y],y));
			}
		}
	}
	printf("%lld\n",dis[T]);
	return 0;
}