#include <bits/stdc++.h>
using namespace std;
const int N = 5e5 + 7;
const long double eps = 1e-7;
const string alpha = "abcdefghijklmnopqrstuvwxyz";
int dx[8] = {+1, +1, +1, 0, 0, -1, -1, -1};
int dy[8] = {+1, 0, -1, +1, -1, +1, 0, -1};
long long power(long long x, long long y) {
  long long res = 1;
  x = x;
  while (y > 0) {
    if (y & 1) res = (res * x);
    y = y >> 1;
    x = (x * x);
  }
  return res;
}
template <typename T>
T gcd(T a, T mp) {
  if (a == 0) return mp;
  return gcd(mp % a, a);
}
template <typename T>
T powm(T a, T mp, long long m) {
  T cnt = 1;
  while (mp > 0) {
    if (mp % 2 == 1) cnt = (cnt * a) % m;
    mp /= 2;
    a = (a * a) % m;
  }
  return cnt % m;
}
long long ncr(long long n, long long r) {
  long long res = 1;
  if (r > n) return 0;
  if (r > n - r) r = n - r;
  for (long long i = 0; i < r; i++) {
    res *= (n - i);
    res /= (i + 1);
  }
  return res;
}
long long sqr(long long x) { return x * x; }
void prec() {}
long long pre[N], ans;
void run() {
  long long a[26];
  for (long long i = (0); i <= (25); ++i) cin >> a[i];
  string s;
  cin >> s;
  int n = (long long)s.size();
  s = '?' + s;
  for (int i = 1; i <= n; ++i) pre[i] = pre[i - 1] + a[s[i] - 'a'];
  for (char ch = 'a'; ch <= 'z'; ch++) {
    map<long long, long long> now;
    for (long long i = 1; i <= n; i++) {
      if (s[i] != ch) continue;
      ans += now[pre[i] - a[s[i] - 'a']];
      now[pre[i]]++;
    }
  }
  cout << ans;
}
int main() {
  cin.sync_with_stdio(0);
  cin.tie(0);
  cin.exceptions(cin.failbit);
  int tc = 1;
  prec();
  for (long long i = 0; i < tc; ++i) run();
  return 0;
}
