#include <bits/stdc++.h>
using namespace std;
//#include <boost/multiprecision/cpp_int.hpp>
//using multiInt = boost::multiprecision::cpp_int;

using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template <typename Q_type>
using smaller_queue = priority_queue<Q_type, vector<Q_type>, greater<Q_type>>;

const int MOD_TYPE = 1;
const ll MOD = (MOD_TYPE == 1 ? (ll)(1e9 + 7) : 998244353);
const int INF = (int)1e9;
const ll LINF = (ll)4e18;
const ld DINF = 1e12;
const ld PI = acos(-1.0);
const ld EPS = 1e-11;

#define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define MP make_pair
#define MT make_tuple
#define YES(n) cout << ((n) ? "YES" : "NO") << "\n"
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define Possible(n) cout << ((n) ? "Possible" : "Impossible") << endl
#define possible(n) cout << ((n) ? "possible" : "impossible") << endl
#define Yay(n) cout << ((n) ? "Yay!" : ":(") << endl
#define all(v) v.begin(), v.end()
#define NP(v) next_permutation(all(v))
#define dbg(x) cerr << #x << ":" << x << endl;

vector<int> Dx = {0, 0, -1, 1, -1, 1, -1, 1, 0};
vector<int> Dy = {1, -1, 0, 0, -1, -1, 1, 1, 0};

int main()
{
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << setprecision(30) << setiosflags(ios::fixed);

  int n;
  cin >> n;
  int x[18] = {};
  rep(i, n)
  {
    int pow2 = 1;
    rep(j, n)
    {
      int xi;
      cin >> xi;
      x[i] += xi * pow2;
      pow2 *= 2;
    }
  }
  int a[18];
  rep(i, n) cin >> a[i];

  auto simulate = [&](int bi) {
    bitset<18> b_lie(bi);
    bitset<18> bx[18];
    rep(i, n) bx[i] = bitset<18>(x[i]);
    rep(i, n)
    {
      if (!b_lie[i])
        continue;
      rep(j, n)
      {
        bx[j][i] = 0;
      }
    }

    set<int> st;
    while (1)
    {
      bool update = false;

      rep(i, n)
      {
        if (bx[i].to_ulong() == 0 && !st.count(i))
        {
          update = true;
          st.insert(i);
          rep(j, n)
          {
            bx[j][i] = 0;
          }
        }
      }

      if (!update)
      {
        if (st.size() == n)
          break;
        else
          return INF;
      }
    }

    int sum = 0;
    rep(i, n)
    {
      if (b_lie[i])
        sum += a[i];
    }
    return sum;
  };

  int Min = INF;
  rep(bi, 1 << n)
  {
    Min = min(Min, simulate(bi));
  }
  cout << Min << endl;
  return 0;
}