#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n);i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef pair<int,int> P;
constexpr int INF = 1e9;
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];
  vector<int> ok(n,0);
  rep(i,n) rep(j,n) if (x[i][j] == 1) ok[i] |= (1 << j);

  vector<int> dp(1<<n, INF);
  dp[0] = 0;
  for (int bit = 0; bit < (1 << n); bit++) {
    for (int j = 0; j < n; j++) {
      if (bit & (1 << j)) continue;
      int key = 0;
      for (int k = 0; k < n; k++) if (bit & (1 << k) && x[j][k]) key |= (1 << k);
      if (key == ok[j]) dp[bit | (1 << j)] = min(dp[bit | (1 << j)], dp[bit]);
      else dp[bit | (1 << j)] = min(dp[bit | (1 << j)], dp[bit] + a[j]);
    }
  }
  cout << dp[(1<<n)-1] << endl;
  return 0;
}