//unordered_map 124ms
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<map>
#include<vector>
#include<queue>
#include<tr1/unordered_map>
using namespace std;
using namespace std::tr1;

const int MAXN=305;

int n,t[MAXN],a[MAXN];
unordered_map<int,int> vis,d;

struct node{
    int u,val;
    node(){}
    node(int _u,int _val):u(_u),val(_val){}
    bool operator < (const node &x) const{
        return val>x.val;
    }
};

int gcd(int x,int y){if(!y)return x;return gcd(y,x%y);}

void dj(int s){
    priority_queue<node> q;
    d[s]=0;
    q.push(node(s,0));
    while(!q.empty()){
        int u=q.top().u; q.pop();
        if(vis[u]) continue;
        vis[u]=1;
        for(int i=1;i<=n;i++){
            int v=gcd(u,t[i]);
            if(d.find(v)==d.end()||d[v]>d[u]+a[i]){
                d[v]=d[u]+a[i];
                q.push(node(v,d[v]));
            }
        }
    }
}

int main(){
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
        scanf("%d",&t[i]);
    for(int i=1;i<=n;i++)
        scanf("%d",&a[i]);
    dj(0);
    if(d.find(1)==d.end()) return puts("-1"),0;
    printf("%d\n",d[1]);
}
/*
//ͨmap  140ms
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<map>
#include<vector>
#include<queue>
using namespace std;

const int MAXN=305;

int n,t[MAXN],a[MAXN];
map<int,int> vis,d;

struct node{
    int u,val;
    node(){}
    node(int _u,int _val):u(_u),val(_val){}
    bool operator < (const node &x) const{
        return val>x.val;
    }
};

int gcd(int x,int y){if(!y)return x;return gcd(y,x%y);}

void dj(int s){
    priority_queue<node> q;
    d[s]=0;
    q.push(node(s,0));
    while(!q.empty()){
        int u=q.top().u; q.pop();
        if(vis[u]) continue;
        vis[u]=1;
        for(int i=1;i<=n;i++){
            int v=gcd(u,t[i]);
            if(d.find(v)==d.end()||d[v]>d[u]+a[i]){
                d[v]=d[u]+a[i];
                q.push(node(v,d[v]));
            }
        }
    }
}

int main(){
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
        scanf("%d",&t[i]);
    for(int i=1;i<=n;i++)
        scanf("%d",&a[i]);
    dj(0);
    if(d.find(1)==d.end()) return puts("-1"),0;
    printf("%d\n",d[1]);
}
*/