Arthur has bought a beautiful big table into his new flat. When he came home, Arthur noticed that the new table is unstable.

In total the table Arthur bought has *n* legs, the length of the *i*-th leg is *l*<sub class="lower-index">*i*</sub>.

Arthur decided to make the table stable and remove some legs. For each of them Arthur determined number *d*<sub class="lower-index">*i*</sub> — the amount of energy that he spends to remove the *i*-th leg.

A table with *k* legs is assumed to be stable if there are more than half legs of the maximum length. For example, to make a table with 5 legs stable, you need to make sure it has at least three (out of these five) legs of the maximum length. Also, a table with one leg is always stable and a table with two legs is stable if and only if they have the same lengths.

Your task is to help Arthur and count the minimum number of energy units Arthur should spend on making the table stable.
The first line of the input contains integer *n* (1 ≤ *n* ≤ 10<sup class="upper-index">5</sup>) — the initial number of legs in the table Arthur bought.

The second line of the input contains a sequence of *n* integers *l*<sub class="lower-index">*i*</sub> (1 ≤ *l*<sub class="lower-index">*i*</sub> ≤ 10<sup class="upper-index">5</sup>), where *l*<sub class="lower-index">*i*</sub> is equal to the length of the *i*-th leg of the table.

The third line of the input contains a sequence of *n* integers *d*<sub class="lower-index">*i*</sub> (1 ≤ *d*<sub class="lower-index">*i*</sub> ≤ 200), where *d*<sub class="lower-index">*i*</sub> is the number of energy units that Arthur spends on removing the *i*-th leg off the table.
f = lambda: map(int, input().split())
n, p, m, s = input(), {}, 0, sorted(zip(f(), f()), key=lambda q: -q[1])
for L, d in s:
    k, D = p.get(L, (-1, 0))
    p[L] = (k + 1, D + d)
for L, (k, D) in p.items():
    if k:
        for l, d in s:
            if l < L:
                D += d
                k -= 1
                if k == 0: break
    m = max(D, m)
print(sum(d for l, d in s) - m)