#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define array2(type, x, y) array<array<type, y>, x>
#define vector2(type) vector<vector<type> >
#define out(...) printf(__VA_ARGS__)

int dxy[] = {0, 1, 0, -1, 0};

/*================================*/

int N;
int X[20][20];
int tmp[20];

void reset_tmp() {
    REP(i, N) tmp[i] = -1;
}

bool ok(int i, int bit) {
    bool ret = true;
    if (tmp[i] > -1) return tmp[i];
    if (tmp[i] == -2) return false; // looping
    tmp[i] = -2;
    REP(j, N) {
        if (X[i][j] == 0) continue;
        if (bit & 1<<j) continue;
        if (!ok(j, bit)) {
            ret = false;
            break;
        }
    }
    return tmp[i] = ret;
}

bool check(int bit) {
    REP(i, N) {
        if (!ok(i, bit)) return false;
    }
    return true;
}

signed main()
{
#if DEBUG
    std::ifstream in("input.txt");
    std::cin.rdbuf(in.rdbuf());
#endif
    cin >> N;
    
    REP(i, N) REP(j, N) cin >> X[i][j];
    
    int A[N];
    REP(i, N) cin >> A[i];
    
    int mi = LONG_LONG_MAX;
    REP(bit, pow(2, N)+1) {
        reset_tmp();
        int cost = 0;
        if (!check(bit)) continue;
        REP(i, N) {
            if (bit & 1<<i) cost += A[i];
        }
        mi = min(mi, cost);
    }
    
    cout << mi << endl;
    
    
    return 0;
}