Box

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

题目描述

That's enough. There's no need to bring Genshin Impact into every little matter. Genshin Impact hasn't done anything to offend or harm you. Why do you keep mindlessly bashing it? miHoYo puts a lot of effort into promoting Chinese culture through their games, and all you do is sit behind a keyboard and criticize a conscientious company. People like you are ruining the future of Chinese games.

Now, the Traveler has $n$ boxes in their possession, some of which have lids that can be shifted left or right by at most one step. If the $i$ -th box is covered with a lid, you gain $a_i$ score.(Covering it with multiple lids still gets only $a_i$ score.) Determine the maximum total game score achievable by covering boxes with lids after shifting serveral(possibly, zero) lids.

输入描述:

The first line contains a integer, (), representing the number of boxes.

The second line contains  integers, where the -th integer  () represents the value of -th box.

The third line contains  integers, where the -th integer  () represents whether -box has a lid.  means there is no lid on the box.

输出描述:

An integer represents the answer.

示例1

输入

复制

3
1 2 3
0 1 0

输出

复制

示例2

输入

复制

3
1 3 1
1 0 1

输出

复制