#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;

int n, plan[25], p[25][25], q[25][25], score, ans, maxS[25], maxSum[25];
//plan[i]表示和男i搭配的女运动员编号(男i, 女plan[i)
//p[i][j]表示(男i,女j)搭配时男i的竞赛优势
//q[i][j]表示(女i,男j)搭配时女i的竞赛优势
//maxS[i]表示男i和任意女运动员匹配时双方竞赛优势的最大值
//maxSum[i]表示从男i开始到男n结束双方竞赛优势最大值的和，即maxS[]的后缀和
bool vis[25]; //vis[i]标记女i是否已经和男运动搭配

void dfs(int step)
{ //接下来考虑第step名男运动员该和谁匹配
	if(step == n + 1)
	{
		ans = max(ans, score);
		return ;
	}
	
	if(score + maxSum[step] < ans) return ;
	
	for(int i = 1; i <= n; i++)
	{ //枚举女i去和男step匹配
		if(vis[i] == true) continue;
		plan[step] = i; //(男step, 女i)
		vis[i] = true;
		score += p[step][i] * q[i][step];
		
		dfs(step + 1);
		
		plan[step] = 0; //(男step, 女i)
		vis[i] = false;
		score -= p[step][i] * q[i][step];
	}
}

int main()
{
	scanf("%d", &n);
	for(int i = 1; i <= n; i++)
		for(int j = 1; j <= n; j++)
			scanf("%d", &p[i][j]);
	for(int i = 1; i <= n; i++)
		for(int j = 1; j <= n; j++)
			scanf("%d", &q[i][j]);
			
	for(int i = 1; i <= n; i++)
		for(int j = 1; j <= n; j++)
			maxS[i] = max(maxS[i], p[i][j] * q[j][i]);
	for(int i = n; i >= 1; i--)
		maxSum[i] = maxSum[i+1] + maxS[i];
			
	dfs(1); //接下来考虑男1该和谁匹配
	
	printf("%d\n", ans);
	
	return 0;
}