B'SmallR likes a game called "Deleting Substrings". In the game you are given a sequence of integers w, you can modify the sequence and get points. The only type of modification you can perform is (unexpected, right?) deleting substrings. More formally, you can choose several contiguous elements of w and delete them from the sequence. Let 's denote the sequence of chosen elements as wl, xe2 x80 x89wl xe2 x80 x89+ xe2 x80 x891, xe2 x80 x89..., xe2 x80 x89wr. They must meet the conditions: After deleting the chosen substring of w, you gain vr xe2 x80 x89- xe2 x80 x89l xe2 x80 x89+ xe2 x80 x891 points. You can perform the described operation again and again while proper substrings exist. Also you can end the game at any time. Your task is to calculate the maximum total score you can get in the game. The first line contains a single integer n (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89400) -- the initial length of w. The second line contains n integers v1, xe2 x80 x89v2, xe2 x80 x89..., xe2 x80 x89vn (0 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89|vi| xe2 x80 x89 xe2 x89 xa4 xe2 x80 x892000) -- the costs of operations. The next line contains n integers w1, xe2 x80 x89w2, xe2 x80 x89..., xe2 x80 x89wn (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89wi xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89109) -- the initial w. Print a single integer -- the maximum total score you can get.'...