#include<iostream>

#include<cstdio>

#include<map>

using namespace std;

int gcd(int a,int b)

{

    return b?gcd(b,a%b):a;

} 

int l[],c[];

int main()

{

    int n;

    cin >> n;

    for(int i = ;i <= n;i++)    cin >> l[i];

    for(int i = ;i <= n;i++)    cin >> c[i];

    map<int,int> mp;

    mp.clear();

    map<int,int>::iterator it;

    mp[] = ;

    for(int i = ;i <= n;i++)

    {

        for(it = mp.begin();it != mp.end();it++)

        {

            int temp = gcd(l[i],it->first);

            if(mp.count(temp))    mp[temp] = min(mp[temp],it->second+c[i]);

            else    mp[temp] = it->second+c[i];

        }

    }

    if(mp.count())    printf("%d\n",mp[]);

    else    printf("-1\n");

    return ;

}