#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <array>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <fstream>
#include <complex>
#include <cstring>
#include <unordered_map>
using namespace std;

using ll = long long;
using P = pair<int, int>;
constexpr int INF = 1001001001;
constexpr int mod = 1000000007;
// constexpr int mod = 998244353;

template<class T>
inline bool chmax(T& x, T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template<class T>
inline bool chmin(T& x, T y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n;
    cin >> n;
    vector<vector<int>> g(n, vector<int>(n));
    vector<vector<int>> graph(n);
    vector<int> in(n);
    for(int j = 0; j < n; ++j){
        for(int i = 0; i < n; ++i){
            cin >> g[i][j];
            if(g[i][j]){
                graph[i].emplace_back(j);
                in[j] += 1;
            }
        }
    }
    vector<int> a(n);
    for(int i = 0; i < n; ++i)  cin >> a[i];

    int ans = INF;
    for(int mask = 0; mask < 1 << n; ++mask){
        auto indeg = in;
        queue<int> que;
        int sum = 0;
        for(int i = 0; i < n; ++i){
            if(mask >> i & 1){
                sum += a[i];
                for(int v : graph[i])   indeg[v] -= 1;
            }
        }
        for(int i = 0; i < n; ++i){
            if(indeg[i] == 0)   que.emplace(i);
        }
        int cnt = 0;
        while(!que.empty()){
            int u = que.front();
            que.pop();
            cnt += 1;
            if(mask >> u & 1)   continue;
            for(int v : graph[u]){
                if(--indeg[v] == 0) que.emplace(v);
            }
        }
        if(cnt == n)    chmin(ans, sum);
    }

    cout << ans << '\n';

    return 0;
}