#include<cstdio>

#include<cstring>

#include<algorithm>

#include<queue>

using namespace std;

int const xn=,xm=8e6+;

int n,hd[xn],ct,to[xm],nxt[xm],w[xm],dis[xn];

bool vis[xn];

struct N{

  int id,d;

  N(int x=,int d=):id(x),d(d) {}

  bool operator < (const N &y) const

  {return d>y.d;}

};

priority_queue<N>q;

int rd()

{

  int ret=,f=; char ch=getchar();

  while(ch<''||ch>''){if(ch=='-')f=; ch=getchar();}

  while(ch>=''&&ch<='')ret=ret*+ch-'',ch=getchar();

  return f?ret:-ret;

}

void add(int x,int y,int z){to[++ct]=y; nxt[ct]=hd[x]; hd[x]=ct; w[ct]=z;}

int id(int x,int y)

{

  if(x<||y>n)return n*n+;

  if(x>n||y<)return ;

  return (x-)*n+y;

}

void dij()

{

  memset(dis,0x3f,sizeof dis);

  dis[]=; q.push(N(,));

  while(q.size())

    {

      int x=q.top().id; q.pop();

      if(vis[x])continue; vis[x]=;

      for(int i=hd[x],u;i;i=nxt[i])

    if(dis[u=to[i]]>dis[x]+w[i])

      {

        dis[u]=dis[x]+w[i];

        q.push(N(u,dis[u]));

      }

    }

}

int main()

{

  n=rd();

  for(int i=;i<=n+;i++)

    for(int j=,x;j<=n;j++)

      x=rd(),add(id(i,j),id(i-,j),x);

  for(int i=;i<=n;i++)

    for(int j=,x;j<=n+;j++)

      x=rd(),add(id(i,j-),id(i,j),x);

  for(int i=;i<=n+;i++)

    for(int j=,x;j<=n;j++)

      x=rd(),add(id(i-,j),id(i,j),x);

  for(int i=;i<=n;i++)

    for(int j=,x;j<=n+;j++)

      x=rd(),add(id(i,j),id(i,j-),x);

  dij();

  printf("%d\n",dis[n*n+]);

  return ;

}