Fox Ciel is playing a game. In this game there is an infinite long tape with cells indexed by integers (positive, negative and zero). At the beginning she is standing at the cell 0.

There are also n cards, each card has 2 attributes: length li and cost ci. If she pays ci dollars then she can apply i-th card. After applying i-th card she becomes able to make jumps of length li, i. e. from cell x to cell (x - li) or cell (x + li).

She wants to be able to jump to any cell on the tape (possibly, visiting some intermediate cells). For achieving this goal, she wants to buy some cards, paying as little money as possible. 

If this is possible, calculate the minimal cost.

Input

The first line contains an integer n (1 ≤ n ≤ 300), number of cards.

The second line contains n numbers li (1 ≤ li ≤ 109), the jump lengths of cards.

The third line contains n numbers ci (1 ≤ ci ≤ 105), the costs of cards.

Output

If it is impossible to buy some cards and become able to jump to any cell, output -1. Otherwise output the minimal cost of buying such set of cards.

Examples

Input

3
100 99 9900
1 1 1


Output

2


Input

5
10 20 30 40 50
1 1 1 1 1


Output

-1


Input

7
15015 10010 6006 4290 2730 2310 1
1 1 1 1 1 1 10


Output

6


Input

8
4264 4921 6321 6984 2316 8432 6120 1026
4264 4921 6321 6984 2316 8432 6120 1026


Output

7237

Note

In first sample test, buying one card is not enough: for example, if you buy a card with length 100, you can't jump to any cell whose index is not a multiple of 100. The best way is to buy first and second card, that will make you be able to jump to any cell.

In the second sample test, even if you buy all cards, you can't jump to any cell whose index is not a multiple of 10, so you should output -1.
/*
-------------------------------------------------------------------
* @Name:           512B Fox And Jumping
* @Author:         Shawn
* @Create Time:    2020/7/14 23:28:43  (UTC+08:00)
* @Url:            https://codeforces.com/contest/512/problem/B
* @Description:    
-------------------------------------------------------------------
                                     /~\
                                    |oo )
                                    _\=/_
                    ___        #   /  _  \
                   / ()\        \\//|/.\|\\
                 _|_____|_       \/  \_/  ||
                | | === | |         |\ /| ||
                |_|  O  |_|         \_ _/  #
                 ||  O  ||          | | |
                 ||__*__||          | | |
                |~ \___/ ~|         []|[]
                /=\ /=\ /=\         | | |
________________[_]_[_]_[_]________/_]_[_\_________________________
*/

import java.io.*;
import java.util.*;

public class CF_512B_FoxAndJumping
{
    public static void main(String[] args) throws IOException
    {
        boolean isLocal= System.getProperty("ONLINE_JUDGE") == null;
        long startTime = 0;
        if (isLocal)
        {
            startTime = System.currentTimeMillis();
            //redirect stdin/stdout to local file
            System.setIn(new FileInputStream(new File("CF_512B_FoxAndJumping.in")));
            //System.setOut(new PrintStream(new File("CF_512B_FoxAndJumping.out")));
        }

        Scanner in = new Scanner(System.in);
        PrintStream out = System.out;

        new CF_512B_FoxAndJumping_Solution().Solve(in, out);

        in.close();
        out.close();
        
        if (isLocal)
        {
            System.err.println("program exited after: " + (System.currentTimeMillis() - startTime) + "ms");
        }        
    }
}


class CF_512B_FoxAndJumping_Solution
{
    public int gcd(int a, int b)
    {
        return (b > 0) ? gcd(b,a % b) : a;
    }

    public void Solve(Scanner in, PrintStream out)
    {
        /*
        int n      = in.nextInt();        // read input as integer
        long k     = in.nextLong();       // read input as long
        double d   = in.nextDouble();     // read input as double
        String str = in.next();           // read input as String
        String s   = in.nextLine();       // read whole line as String
        */        

        int n = in.nextInt();

        var l = new int[n];
        for (int i = 0; i <= n - 1; ++i) l[i] = in.nextInt();

        var c = new int[n];
        for (int i = 0; i <= n - 1; ++i) c[i] = in.nextInt();

        var f = new HashMap<Integer, Integer>();

        for (int i = 0; i <= n - 1; ++i)
        {
            if (f.keySet().contains(l[i]) ) f.put(l[i], Math.min(f.get(l[i]), c[i]));
            else                                   f.put(l[i], c[i]);

            var f2 = new HashMap<Integer, Integer>();
            f2.putAll(f);
            var it=f.entrySet().iterator();
            while (it.hasNext())
            {
                var item = it.next();
                int key = item.getKey();
                int val = item.getValue();

                int nxt = gcd(key, l[i]);

                if (f2.containsKey(nxt))
                {
                    f2.put(nxt, Math.min(f2.get(nxt), val + c[i]));
                }
                else
                {
                    f2.put(nxt, val + c[i]);
                }
            }
            f.clear();
            f.putAll(f2);
        }


        if (f.keySet().contains(1) == true) out.println(f.get(1));
        else                                out.println(-1);
    }
}


