#include<bits/stdc++.h>
using namespace std;
const int N=1e5+7;

int n;
int c[N],l[N];
map<int,int> dp;

int gcd(int a,int b)
{
    return b? gcd(b,a%b):a;
}

int main()
{
    scanf("%d",&n);
    for(int i=1;i<=n;i++) scanf("%d",&l[i]);
    for(int i=1;i<=n;i++) scanf("%d",&c[i]);
    for(int i=1;i<=n;i++)
    {
        if(dp[l[i]]) dp[l[i]]=min(dp[l[i]],c[i]);
        else dp[l[i]]=c[i];
        for(map<int,int>::iterator it=dp.begin();it!=dp.end();++it)
        {
            int t=gcd(it->first,l[i]);
            if(dp[t]) dp[t]=min(dp[t],it->second+c[i]);
            else dp[t]=it->second+c[i];
        }
    }
    printf("%d\n",dp[1]? dp[1]:-1);
}