You are given a string S and an array of strings [t_1, t_2, ..., t_k]. Each string t_i consists of lowercase Latin letters from a to n; S consists of lowercase Latin letters from a to n and no more than 14 question marks.

Each string t_i has its cost c_i — an integer number. The value of some string T is calculated as ∑_{i = 1}^{k} F(T, t_i) ⋅ c_i, where F(T, t_i) is the number of occurences of string t_i in T as a substring. For example, F(aaabaaa, aa) = 4.

You have to replace all question marks in S with pairwise distinct lowercase Latin letters from a to n so the value of S is maximum possible.

Input

The first line contains one integer k (1 ≤ k ≤ 1000) — the number of strings in the array [t_1, t_2, ..., t_k].

Then k lines follow, each containing one string t_i (consisting of lowercase Latin letters from a to n) and one integer c_i (1 ≤ |t_i| ≤ 1000, -10^6 ≤ c_i ≤ 10^6). The sum of lengths of all strings t_i does not exceed 1000.

The last line contains one string S (1 ≤ |S| ≤ 4 ⋅ 10^5) consisting of lowercase Latin letters from a to n and question marks. The number of question marks in S is not greater than 14.

Output

Print one integer — the maximum value of S after replacing all question marks with pairwise distinct lowercase Latin letters from a to n.

Examples

Input


4
abc -10
a 1
b 1
c 3
?b?


Output


5


Input


2
a 1
a 1
?


Output


2


Input


3
a 1
b 3
ab 4
ab


Output


8


Input


1
a -1
?????????????


Output


0


Input


1
a -1
??????????????


Output


-1
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1005;
long long inf = 0x3f3f3f3f3f3f3f3f;
long long to[20][maxn], w[20][maxn];
long long dp[1 << 14][maxn];
vector<string> v;
class ACtree {
 public:
  int tr[maxn][30], fail[maxn];
  long long c[maxn];
  int tot = 0;
  queue<int> q;
  void insrt(string &s, int cost) {
    int u = 0;
    for (int i = 0; i < s.size(); i++) {
      if (!tr[u][s[i] - 'a']) tr[u][s[i] - 'a'] = ++tot;
      u = tr[u][s[i] - 'a'];
    }
    c[u] += cost;
  }
  void build() {
    for (int i = 0; i < 26; i++)
      if (tr[0][i]) q.push(tr[0][i]);
    while (!q.empty()) {
      int u = q.front();
      c[u] += c[fail[u]];
      q.pop();
      for (int i = 0; i < 26; i++) {
        if (tr[u][i])
          fail[tr[u][i]] = tr[fail[u]][i], q.push(tr[u][i]);
        else
          tr[u][i] = tr[fail[u]][i];
      }
    }
  }
  void query(string &s, int x, int t) {
    long long u = x, val = 0;
    for (int i = 0; i < s.size(); i++) {
      u = tr[u][s[i] - 'a'];
      val += c[u];
    }
    to[t][x] = u;
    w[t][x] = val;
    return;
  }
} tree;
string s, s2;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int k;
  cin >> k;
  for (int i = 0; i < k; i++) {
    cin >> s;
    int x;
    cin >> x;
    tree.insrt(s, x);
  }
  cin >> s;
  tree.build();
  int last = 0;
  for (int i = 0; i < s.size(); i++) {
    if (s[i] == '?') {
      v.push_back(s.substr(last, i - last));
      last = i + 1;
    }
  }
  v.push_back(s.substr(last));
  k = v.size() - 1;
  for (int i = 0; i < v.size(); i++) {
    auto x = v[i];
    for (int j = 0; j <= tree.tot; j++) {
      tree.query(x, j, i);
    }
  }
  for (int i = 0; i <= tree.tot; i++)
    for (int j = 0; j < (1 << 14); j++) dp[j][i] = -inf;
  dp[0][to[0][0]] = w[0][0];
  long long res = -inf;
  if (k == 0) res = dp[0][to[0][0]];
  for (int i = 0; i < (1 << 14); i++) {
    for (int j = 0; j <= tree.tot; j++) {
      if (dp[i][j] == -inf) continue;
      for (int q = 0; q < 14; q++) {
        if (i & (1 << q)) continue;
        int x = tree.tr[j][q];
        long long t = tree.c[x];
        int temp = __builtin_popcount(i) + 1;
        t += w[temp][x];
        x = to[temp][x];
        dp[i | (1 << q)][x] = max(dp[i | (1 << q)][x], dp[i][j] + t);
        if (temp == k) res = max(res, dp[i | (1 << q)][x]);
      }
    }
  }
  cout << res << endl;
}
