#include <cstdio>
const int MAXN=2005;
const int INF=0x3f3f3f3f;
int n,now=0;
int rela[MAXN][MAXN],match[MAXN];
int ex_boy[MAXN],ex_girl[MAXN],slack[MAXN];
int vis_boy[MAXN],vis_girl[MAXN];
int boy[MAXN][MAXN],girl[MAXN][MAXN];void read(int &x)
{int out=1;char c;x=0;while(c<'0' || c>'9'){if(c=='-')out=-1;c=getchar();}while(c>='0'&&c<='9'){x=x*10+c-48;c=getchar();}x=x*out;
}void write(long long x)
{if(x>10)write(x/10);putchar(x%10+48);
}void init()
{read(n);for(int i=1;i<=n;i++)for(int j=1;j<=n;j++)read(boy[i][j]);for(int i=1;i<=n;i++)for(int j=1;j<=n;j++)read(girl[i][j]);for(int i=1;i<=n;i++)for(int j=1;j<=n;j++)rela[i][j]=boy[i][j]*girl[j][i];
}int dfs(int x)
{int cp;vis_girl[x]=now;for(int y=1;y<=n;y++){if(vis_boy[y]==now)continue;cp=ex_girl[x]+ex_boy[y]-rela[x][y];if(cp==0){vis_boy[y]=now;if((match[y]==0)||dfs(match[y])){match[y]=x;return true;}}else if(cp<slack[y])slack[y]=cp;}return false;
}long long KM()
{for(int i=1;i<=n;i++){match[i]=ex_girl[i]=ex_boy[i]=0;for(int j=1;j<=n;j++)if(rela[i][j]>ex_girl[i])ex_girl[i]=rela[i][j];} for(int i=1;i<=n;i++){now=0;for(int j=1;j<=n;j++){slack[j]=INF;vis_boy[j]=vis_girl[j]=0;}while(1){now++;if(dfs(i))break;int d=INF;for(int j=1;j<=n;j++)if(vis_boy[j]!=now&&slack[j]<d)d=slack[j];for(int j=1;j<=n;j++){if(vis_girl[j]==now)ex_girl[j]-=d;if(vis_boy[j]==now)ex_boy[j]+=d;else slack[j]-=d;}}}long long res=0;for(int i=1;i<=n;i++)res+=rela[match[i]][i];return res;
}int main()
{init();write(KM());return 0;
}