bzoj4514

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<queue>
#include<cmath>
#define inf 0x3f3f3f3f
#define ll long long
#define N 405
using namespace std;
int n,m,tot,S,T,flow,hd[N],pre[N],a[N],vis[N];
ll cost,d[N];
struct edge{int u,v,next,cap;ll w;}e[N*N*2];
void adde(int u,int v,ll w,int c){
    e[tot].v=v;
    e[tot].u=u;
    e[tot].w=w;
    e[tot].next=hd[u];
    e[tot].cap=c;
    hd[u]=tot++;
}
struct ele{int a,b,c;}p[N];
bool cmp(ele a,ele b){return a.a>b.a;}
bool judge(int x){
    int y=sqrt(x);
    if(x<=1)return 0;
    for(int i=2;i<=y;i++)
    if(!(x%i))return 0;
    return 1;
}
bool spfa(){
    queue<int>q;ll t=(ll)inf*inf;
    for(int i=S;i<=T;i++)d[i]=-t;d[S]=0;
    memset(pre,-1,sizeof(pre));a[S]=1<<30;
    q.push(S);
    while(!q.empty()){
        int u=q.front();q.pop();vis[u]=0;
        for(int i=hd[u];~i;i=e[i].next){
            int v=e[i].v;
            if(e[i].cap&&d[v]<d[u]+e[i].w){
                d[v]=d[u]+e[i].w;
                pre[v]=i;
                a[v]=min(a[u],e[i].cap);
                if(vis[v])continue;
                vis[v]=1;q.push(v);
            }
        }
    }
    if(d[T]==-t)return 0;
    ll tmp=a[T]*d[T];
    if(cost+tmp<0){
        ll res=cost/d[T];
        flow-=(int)res;
        return 0;
    }
    flow+=a[T];cost+=(ll)a[T]*d[T];
    int u=T;
    while(u!=S){
        e[pre[u]].cap-=a[T];
        e[pre[u]^1].cap+=a[T];
        u=e[pre[u]].u;
    }
    return 1;
}
int main(){
#ifdef wsy
    freopen("pair4.in","r",stdin);
#else
    //freopen(".in","r",stdin);
    //freopen(".out","w",stdout);
#endif
    memset(hd,-1,sizeof(hd));
    scanf("%d",&n);
    S=0;T=n*2+1;
    for(int i=1;i<=n;i++)scanf("%d",&p[i].a);
    for(int i=1;i<=n;i++)scanf("%d",&p[i].b);
    for(int i=1;i<=n;i++)scanf("%d",&p[i].c);
    sort(p+1,p+1+n,cmp);
    for(int i=1;i<=n;i++)
    for(int j=i+1;j<=n;j++){
        if(p[i].a%p[j].a)continue;
        if(!judge(p[i].a/p[j].a))continue;
        adde(i,j+n,(ll)p[i].c*p[j].c,inf);
        adde(j+n,i,(ll)p[i].c*p[j].c*(-1),0);
        adde(j,i+n,(ll)p[i].c*p[j].c,inf);
        adde(i+n,j,(ll)p[i].c*p[j].c*(-1),0);
    }
    for(int i=1;i<=n;i++){
        adde(S,i,0,p[i].b);
        adde(i,S,0,0);
        adde(i+n,T,0,p[i].b);
        adde(T,i+n,0,0);
    }
    while(spfa());
    printf("%d",flow/2);
    return 0;
}