using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;
using System.Runtime.Intrinsics.Arm;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var n = NN;
        var x = NArr(n);
        var a = NList;
        var bitmax = 1 << n;
        var ans = int.MaxValue;
        var tree = new List<int>[n];
        for (var i = 0; i < n; ++i) tree[i] = new List<int>();
        var refs = new int[n];
        for (var i = 0; i < n; ++i) for (var j = 0; j < n; ++j) if (x[i][j] == 1) { tree[j].Add(i); ++refs[i]; }
        for (var b = 0; b < bitmax; ++b)
        {
            var cost = 0;
            var lied = new bool[n];
            var tmp = b;
            for (var i = 0; i < n; ++i)
            {
                if (tmp % 2 == 1)
                {
                    lied[i] = true;
                    cost += a[i];
                }
                tmp >>= 1;
            }
            if (cost >= ans) continue;
            var nrefs = (int[])refs.Clone();
            var q = new Queue<int>();
            for (var i = 0; i < n; ++i) if (lied[i]) foreach (var next in tree[i]) --nrefs[next];
            for (var i = 0; i < n; ++i) if (nrefs[i] == 0) q.Enqueue(i);
            while (q.Count > 0)
            {
                var cur = q.Dequeue();
                if (lied[cur]) continue;
                foreach (var next in tree[cur])
                {
                    --nrefs[next];
                    if (nrefs[next] == 0) q.Enqueue(next);
                }
            }
            var flg = true;
            for (var i = 0; i < n; ++i) if (nrefs[i] > 0) flg = false;
            if (flg) ans = Math.Min(ans, cost);
        }
        WriteLine(ans);
    }
}