#include<bits/stdc++.h>
#define FILE "read"
#define MAXN 500010
#define INF 1000000000
using namespace std;
struct node{int y,next,v,rel;}e[MAXN<<2];
int n,len,ans,cnt,S,T,Link[MAXN],id[MAXN],level[MAXN];
queue<int>q;
char buf[1<<15],*fs,*ft;
inline char getc(){return (fs==ft&&(ft=(fs=buf)+fread(buf,1,1<<15,stdin),fs==ft))?0:*fs++;}
inline int read(){
	int x=0,f=1;  char ch=getc();
	while(!isdigit(ch))  {if(ch=='-')  f=-1;  ch=getc();}
	while(isdigit(ch))  {x=x*10+ch-'0';  ch=getc();}
	return x*f;
}
void insert(int x,int y,int v){
	e[++len].next=Link[x];Link[x]=len;e[len].y=y;e[len].v=v;e[len].rel=len+1;
	e[++len].next=Link[y];Link[y]=len;e[len].y=x;e[len].v=0;e[len].rel=len-1;
}
bool bfs(){
	memset(level,-1,sizeof(level));
	q.push(S);  level[S]=0;
	while(!q.empty()){
		int x=q.front(); q.pop();
		for(int i=Link[x];i;i=e[i].next)
			if(level[e[i].y]==-1&&e[i].v){
				q.push(e[i].y);
				level[e[i].y]=level[x]+1;
			}
	}
	return level[T]>=0;
}
int MAXFLOW(int x,int flow){
	if(x==T)  return flow;
	int d=0,maxflow=0;
	for(int i=Link[x];i&&maxflow<flow;i=e[i].next)
		if(level[e[i].y]==level[x]+1&&e[i].v)
			if(d=MAXFLOW(e[i].y,min(e[i].v,flow-maxflow)))
				e[i].v-=d,e[e[i].rel].v+=d,maxflow+=d;
	if(!maxflow)  level[x]=-1;
	return maxflow;
}
int main(){
	freopen(FILE".in","r",stdin);
	freopen(FILE".out","w",stdout);
	n=read();  S=0;  T=++cnt;
	for(int i=1;i<=n;++i)for(int j=1;j<=n;++j){
		int x=++cnt,v=read();  insert(S,x,v); ans+=v; 
		if(!id[i])  id[i]=++cnt;
		if(!id[j])  id[j]=++cnt;
		insert(x,id[i],INF);  insert(x,id[j],INF);
	}
	for(int i=1;i<=n;++i) insert(id[i],T,read());
	int d=0; while(bfs()) while(d=MAXFLOW(S,INF)) ans-=d;
	printf("%d\n",ans);
	return 0;
}