#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#define _USE_MATH_DEFINES
#include <cmath>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;

#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()

const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007;
// const int MOD = 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
// const int dy[] = {1, 1, 0, -1, -1, -1, 0, 1},
//           dx[] = {0, -1, -1, -1, 0, 1, 1, 1};

struct IOSetup {
  IOSetup() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);
    cerr << fixed << setprecision(10);
  }
} iosetup;
/*-------------------------------------------------*/
int main() {
  int n; cin >> n;
  vector<vector<int> > conf(1 << n);
  REP(i, n) {
    int idx = 0;
    REP(j, n) {
      int x; cin >> x;
      if (x == 1) idx |= 1 << j;
    }
    REP(j, 1 << n) {
      if (((idx & j) == idx) && !(j >> i & 1)) conf[j].emplace_back(i);
    }
  }
  vector<int> a(n); REP(i, n) cin >> a[i];
  int ans = accumulate(ALL(a), 0);
  REP(i, (1 << n) - 1) {
    int now = i;
    while (!conf[now].empty()) {
      int nx = now;
      for (int e : conf[now]) nx |= 1 << e;
      now = nx;
    }
    if (now == (1 << n) - 1) {
      int tmp = 0;
      REP(j, n) if (i >> j & 1) tmp += a[j];
      ans = min(ans, tmp);
    }
  }
  cout << ans << '\n';
  return 0;
}