#include<bits/stdc++.h>
using namespace std;
int n,pi[101],p[101][101],q[101][101],s,ans = 0,maxs[101],maxsum[101];
bool vis[101];
void dfs(int step)
{
	if(s + maxsum[step] <= ans)
	{
		return;
	}
	if(step > n)
	{
		ans = max(ans,s);
	}
	for(int i = 1;i <= n;i++)
	{
		if(vis[i] == true)
		{
			continue; 
		}
		vis[i] = true;
		s += p[step][i] * q[i][step];
		pi[step] = i;
		dfs(step + 1);
		vis[i] = false;
		s -= p[step][i] * q[i][step];
	}
}
int main()
{
	cin>>n;
	for(int i = 1;i <= n;i++)
	{
		for(int j = 1;j <= n;j++)
		{
			cin>>p[i][j];
		}
	}
	for(int i = 1;i <= n;i++)
	{
		for(int j = 1;j <= n;j++)
		{
			cin>>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);
	cout<<ans;
    return 0;
}