#include <cassert>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <string.h>
#include <vector>

using namespace std;
typedef long long ll;

int main() {
  int N;
  cin >> N;
  int X[N][N];
  int values[N];
  memset(values, 0, sizeof(values));

  for (int i = 0; i < N; ++i) {
    int value = 0;
    for (int j = 0; j < N; ++j) {
      cin >> X[i][j];
      if (X[i][j] == 1) {
        value |= 1 << j;
      }
    }
    values[i] = value;
  }

  int A[N];
  for (int i = 0; i < N; ++i) {
    cin >> A[i];
  }

  int min_cost = INT_MAX;
  int M = 1 << N;

  for (int mask = 0; mask < M; ++mask) {
    int cost = 0;
    int nmask = mask;

    for (int i = 0; i < N; ++i) {
      if (nmask >> i & 1) {
        cost += A[i];
      }
    }

    bool updated = true;

    for (int i = 0; i < N && updated; ++i) {
      updated = false;

      for (int j = 0; j < N; ++j) {
        int val = values[j];

        if ((val & nmask) == val) {
          nmask |= 1 << j;
          updated = true;
        }
      }

      if (nmask == M - 1) break;
    }

    if (nmask == M - 1) {
      min_cost = min(min_cost, cost);
    }
  }

  cout << min_cost << endl;

  return 0;
}