Due to the installation of a new fire alarm in ITMO server room, the system may be occasionally unavailable on the 27-th of May between 06:00 and 15:00 (UTC).
×

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

D. Fox And Jumping

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputFox 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 *l*_{i} and cost *c*_{i}. If she pays *c*_{i} dollars then she can apply *i*-th card. After applying *i*-th card she becomes able to make jumps of length *l*_{i}, i. e. from cell *x* to cell (*x* - *l*_{i}) or cell (*x* + *l*_{i}).

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 *l*_{i} (1 ≤ *l*_{i} ≤ 10^{9}), the jump lengths of cards.

The third line contains *n* numbers *c*_{i} (1 ≤ *c*_{i} ≤ 10^{5}), 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.

Codeforces (c) Copyright 2010-2019 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: May/27/2019 09:26:51 (f3).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|