#include<cstdio>

 #include<cstring>

 #include<queue>

 #include<algorithm>

 #define rep(i,l,r) for (int i=(l); i<=(r); i++)

 using namespace std;

 priority_queue<pair<int,int> > q;

 const int N=;

 int x,S,T,h[N],to[N],val[N],nxt[N],cnt,dis[N],vis[N],n,num[][];

 void add(int x,int y,int z){ to[++cnt]=y; val[cnt]=z; nxt[cnt]=h[x]; h[x]=cnt; }

 void work(){

     memset(dis,0x3f,sizeof(dis)); dis[S]=;

     q.push(make_pair(,S));

     while(!q.empty()){

         x=q.top().second; q.pop();

         if(vis[x]) continue;

         vis[x]=;

         for(int i=h[x]; i; i=nxt[i])

             if (dis[to[i]]>dis[x]+val[i])

                 dis[to[i]]=dis[x]+val[i],q.push(make_pair(-dis[to[i]],to[i]));

     }

 }

 int main(){

     freopen("bzoj2007.in","r",stdin);

     freopen("bzoj2007.out","w",stdout);

     scanf("%d",&n); S=; T=n*n+;

     rep(i,,n) num[][i]=num[i][n+]=S,num[i][]=num[n+][i]=T;

     rep(i,,n) rep(j,,n) num[i][j]=n*(i-)+j;

     rep(i,,n) rep(j,,n) scanf("%d",&x),add(num[i][j],num[i+][j],x);

     rep(i,,n) rep(j,,n) scanf("%d",&x),add(num[i][j+],num[i][j],x);

     rep(i,,n) rep(j,,n) scanf("%d",&x),add(num[i+][j],num[i][j],x);

     rep(i,,n) rep(j,,n) scanf("%d",&x),add(num[i][j],num[i][j+],x);

     work(); printf("%d\n",dis[T]);

     return ;

 }