value

题号：NC201171
时间限制：C/C++/Rust/Pascal 1秒，其他语言2秒
空间限制：C/C++/Rust/Pascal 256 M，其他语言512 M
64bit IO Format: %lld

题目描述

$\textit{Pang}$ believes that one cannot make an omelet without breaking eggs.

For a subset ${A}$ of $\{1,2,\ldots,n\}$ , we calculate the score of ${A}$ as follows:

Initialize the score as ${0}$ .
For any $i\in A$ , add $a_i$ to the score.
For any pair of integers (i, j) satisfying $i\ge 2$ , $j\ge 2$ , $i\in A$ and $j\in A$ , if there exists positive integer k > 1 such that $i^k=j$ , subtract $b_j$ from the score.

Find the maximum possible score over the choice of ${A}$ .

输入描述:

The first line contains a single integer  .
The second line contains  integers  .
The third line contains  integers  .

输出描述:

Print a single integer  --- the maximum possible score.

示例1

输入

复制

4
1 1 1 2
1 1 1 1

输出

复制

示例2

输入

复制

4
1 1 1 1
1 1 1 2

输出

复制