#include <bits/stdc++.h>

using namespace std;

using ll = long long;

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n;
    cin >> n;
    vector< vector<int> > x(n, vector<int>(n));
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) {
            cin >> x[i][j];
        }
    }
    vector<ll> a(n);
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
    }

    vector<ll> dp(1 << n, 1e15);
    dp[0] = 0;
    for (int i = 0; i < (1 << n) - 1; i++) {
        for (int j = 0; j < n; ++j) {
            if (i & (1 << j)) continue;
            int next_mask = (i | (1 << j));
            ll cost = 0;
            for (int k = 0; k < n; ++k) {
                if (i & (1 << k)) continue;
                if (x[j][k]) {
                    cost += a[k];
                    next_mask |= (1 << k);
                }
            }
            dp[next_mask] = min(dp[next_mask], dp[i] + cost);
        }
    }
    cout << dp[(1 << n) - 1] << "\n";
    return 0;
}