#include<bits/stdc++.h>
#define REP(i,n) for(int i=0,i##_len=(n);i<i##_len;++i)
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
#define All(x) (x).begin(),(x).end()
using namespace std;
using ll = long long;

int main(){
    int N;cin>>N;
    vector<vector<int>> X(N,vector<int>(N));
    REP(i,N) REP(j,N) cin>>X[i][j];
    vector<int> A(N);
    REP(i, N){
        cin >> A[i];
        assert(0<=A[i]&&A[i]<=100000);
    }
    ll ans=INT_MAX;
    REP(bit,1<<N){
        ll res=0;
        REP(j,N) if(bit>>j&1){
            res+=A[j];
        }
        bool flag=true;
        REP(i,N) if(~bit>>i&1){
            rep(j,i+1,N) if(~bit>>j&1){
                if(X[i][j]&&X[j][i]) flag=false;
            }
        }
        if(flag) ans=min(ans,res);
    }
    cout<<ans<<endl;
}