Problem: Market stalls now have the long-awaited game The Colder Scrools V: Nvodsk. The game turned out to be difficult as hell and most students can't complete the last quest ("We don't go to Nvodsk..."). That threatened winter exams. The rector already started to wonder whether he should postpone the winter exams till April (in fact, he wanted to complete the quest himself). But all of a sudden a stranger appeared at the door of his office. "Good afternoon. My name is Chuck and I solve any problems" — he said.

And here they are sitting side by side but still they can't complete the mission. The thing is, to kill the final boss one should prove one's perfect skills in the art of managing letters. One should be a real magician to do that. And can you imagine what happens when magicians start competing... 

But let's put it more formally: you are given a string and a set of integers ai. You are allowed to choose any substring that is a palindrome and delete it. At that we receive some number of points equal to ak, where k is the length of the deleted palindrome. For some k, ak = -1, which means that deleting palindrome strings of such length is forbidden. After a substring is deleted, the remaining part "shifts together", that is, at no moment of time the string has gaps. The process is repeated while the string has at least one palindrome substring that can be deleted. All gained points are summed up.

Determine what maximum number of points can be earned.

"Oh" — said Chuck, raising from the chair, — "I used to love deleting palindromes, just like you, but one day I took an arrow in the Knee".

Input

The first line contains an integer l (1 ≤ l ≤ 150) — the length of the string.

The second line contains exactly l integers ak ( - 1 ≤ ak ≤ 105) — the points a player gains for deleting.

The third line contains exactly l lowercase Latin letters — the original string from which a player can delete palindromes. The line contains no other characters apart from the newline character at the end of the string.

Output

Print a single number — the maximum number of points one can gain if he plays on the given string.

Examples

Input

7
-1 -1 -1 -1 -1 -1 -1
abacaba


Output

0


Input

7
1 -1 -1 -1 -1 -1 -1
abacaba


Output

7


Input

7
1 5 -1 -1 -1 -1 10
abacaba


Output

16

Note

In the first sample we cannot delete any substring, so the best result is 0. In the second sample we are allowed to delete only those palindromes whose length equals 1, thus, if we delete the whole string, we get 7 points. In the third sample the optimal strategy is: first we delete character c, then string aa, then bb, and the last one aa. At that we get 1 + 3 * 5 = 16 points.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
char sir[200];
int cost[200], ans[200], dp[200][200], best[200][200][200];
int n, sol;
int solve(int i, int j, int k, int p);
bool pal(int p1, int p2);
int main() {
  cin >> n;
  for (int i = 1; i <= n; ++i) {
    cin >> cost[i];
    if (cost[i] == -1) {
      cost[i] = -100000000;
    }
  }
  cin >> sir + 1;
  for (int i = 0; i < 200; ++i) {
    for (int j = 0; j < 200; ++j) {
      for (int k = 0; k < 200; ++k) {
        best[i][j][k] = -100000000;
      }
      if (i > j) {
        best[i][j][0] = 0;
      }
      dp[i][j] = -100000000;
    }
  }
  for (int lg = 1; lg <= n; ++lg) {
    for (int i = 1; i <= n - lg + 1; ++i) {
      int j = i + lg - 1;
      for (int p = i; p < j; ++p) {
        for (int k = 0; k < lg; ++k) {
          best[i][j][k] = max(best[i][j][k], solve(i, j, k, p));
        }
      }
      if (sir[i] == sir[j]) {
        if (i != j) {
          for (int k = 2; k <= lg; ++k) {
            best[i][j][k] = max(best[i][j][k], best[i + 1][j - 1][k - 2]);
          }
        } else {
          for (int k = 1; k <= lg; ++k) {
            if (i == n) {
              best[i][j][k] = max(best[i][j][k], 0);
            } else
              best[i][j][k] = max(best[i][j][k], best[i + 1][j - 1][k - 1]);
          }
        }
      }
      for (int p = i; p < j; ++p) {
        dp[i][j] = max(dp[i][j], dp[i][p] + dp[p + 1][j]);
      }
      for (int k = 1; k <= lg; ++k) {
        dp[i][j] = max(dp[i][j], best[i][j][k] + cost[k]);
      }
      best[i][j][0] = dp[i][j];
    }
  }
  for (int i = 1; i <= n; ++i) {
    ans[i] = ans[i - 1];
    for (int j = 0; j < i; ++j) {
      ans[i] = max(ans[i], ans[j] + dp[j + 1][i]);
    }
  }
  cout << ans[n];
  return 0;
}
int solve(int i, int j, int k, int p) {
  return max(best[i][p][k] + dp[p + 1][j], dp[i][p] + best[p + 1][j][k]);
}