#include <bits/stdc++.h>

#define ll long long
#define sum(a, b, mod) (((a) + (b)) % mod)
#define meow(cat...) fprintf(stderr, cat)

const ll MaxN = 5e5 + 10;
const ll MaxM = 5e5 + 10;
const ll inf = 0x3f3f3f3f3f3f3f3f;

struct edge {
    ll next, to, flow, cost;
} e[MaxM << 1];

std::vector<ll> L, R;
ll n, m, s, t, S, T, cnt = 1, mincost, maxflow, a[MaxN], b[MaxN];
ll head[MaxN], c[MaxN], cur[MaxN], vis[MaxN], dis[MaxN], num[MaxN];

ll calc(ll x) {
    ll s = x, res = 0;

    for (ll i = 2; i * i <= x; i++)
        while (s % i == 0)
            s /= i, res++;

    if (s > 1)
        res++;

    return res;
}

void add(ll u, ll v, ll f, ll c) {
    ++cnt;
    e[cnt].to = v;
    e[cnt].flow = f;
    e[cnt].cost = c;
    e[cnt].next = head[u];
    head[u] = cnt;
}

void add_edge(ll u, ll v, ll f, ll c) {
    add(u, v, f, c), add(v, u, 0, -c);
}

inline ll read() {
    ll x = 0, f = 1;
    char ch = getchar();

    while (ch > '9' || ch < '0') {
        if (ch == '-')
            f = 0;

        ch = getchar();
    }

    while (ch <= '9' && ch >= '0')
        x = (x << 1) + (x << 3) + (ch ^ 48), ch = getchar();

    return f ? x : (-x);
}

void init() {
    cnt = 1, mincost = maxflow = 0;
    memset(head, 0, 8 * (n + 10));
}

ll bfs(ll s) {
    std::queue<ll> q;
    memset(dis, 0x3f, 8 * (n + 10));
    memcpy(cur, head, 8 * (n + 10));
    dis[s] = 0, q.push(s), vis[s] = 1;

    while (!q.empty()) {
        ll u = q.front();
        q.pop(), vis[u] = 0;

        for (ll i = head[u]; i; i = e[i].next) {
            ll v = e[i].to, c = e[i].flow;

            if (dis[v] > dis[u] + e[i].cost && c) {
                dis[v] = dis[u] + e[i].cost;

                if (!vis[v])
                    vis[v] = 1, q.push(v);
            }
        }
    }

    return dis[t] != inf;
}

ll dinic(ll u, ll flow) {
    if (u == t) {
        maxflow += flow;
        return flow;
    }

    ll rest = flow;
    vis[u] = 1;

    for (ll i = cur[u]; i && rest; i = e[i].next) {
        ll v = e[i].to, c = e[i].flow, k;

        if (!vis[v] && (dis[v] == dis[u] + e[i].cost) && c) {
            cur[u] = i, k = dinic(v, std::min(c, rest));
            rest -= k, e[i].flow -= k, e[i ^ 1].flow += k;
            mincost += k * e[i].cost;
        }
    }

    vis[u] = 0;
    return flow - rest;
}

void solve() {
    while (bfs(s)) {
        memset(vis, 0, 8 * (n + 10));
        dinic(s, inf);
        memset(vis, 0, 8 * (n + 10));
    }
}

ll check(ll g) {
    init(), add_edge(s, S, g, 0), add_edge(T, t, g, 0);

    for (auto x : L)
        add_edge(S, x, b[x], 0);

    for (auto x : R)
        add_edge(x, T, b[x], 0);

    for (ll i = 0; i < L.size(); i++)
        for (ll j = 0; j < R.size(); j++)
            if ((a[L[i]] % a[R[j]] == 0 && num[L[i]] == num[R[j]] + 1) ||
                    (a[R[j]] % a[L[i]] == 0 && num[L[i]] == num[R[j]] - 1))
                add_edge(L[i], R[j], inf, -(c[L[i]] * c[R[j]]));

    solve(); // meow("%lld %lld\n", g, mincost);
    return (mincost <= 0 && maxflow == g);
}

ll getr() {
    init(), add_edge(s, S, inf, 0), add_edge(T, t, inf, 0);

    for (auto x : L)
        add_edge(S, x, b[x], 0);

    for (auto x : R)
        add_edge(x, T, b[x], 0);

    for (ll i = 0; i < L.size(); i++)
        for (ll j = 0; j < R.size(); j++)
            add_edge(L[i], R[j], inf, 0);

    solve();
    return maxflow;
}

signed main() {
    ll l = 1, r = 0;
    n = read(), s = n + 1, t = n + 2, S = n + 3, T = n + 4;

    for (ll i = 1; i <= n; i++)
        a[i] = read(), num[i] = calc(a[i]);

    for (ll i = 1; i <= n; i++)
        b[i] = read();

    for (ll i = 1; i <= n; i++)
        c[i] = read();

    for (ll i = 1; i <= n; i++)
        (num[i] % 2 == 1) ? L.push_back(i) : R.push_back(i);

    r = getr();

    while (l < r) {
        ll mid = (l + r + 1) >> 1;

        if (check(mid))
            l = mid;
        else
            r = mid - 1;
    }

    printf("%lld\n", l);
    return 0;
}