#include <bits/stdc++.h>
using namespace std;
bool J27 = 1;
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) {
  if (!J27) return;
  cout << name << " : " << arg1 << '\n';
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args) {
  if (!J27) return;
  const char* comma = strchr(names + 1, ',');
  cout.write(names, comma - names) << " : " << arg1 << " | ";
  __f(comma + 1, args...);
}
inline void INP();
const long long N = 3e6 + 7;
const long long INF = LLONG_MAX;
const long long inf = INT_MAX;
long long n, Q;
long long arr[N + 2];
long long val[26];
string str;
void solve() {
  for (long long i = 0; i < (long long)26; i++) cin >> val[i];
  cin >> str;
  n = str.length();
  map<long long, vector<long long> > mp;
  vector<long long> al(26, 0);
  long long sum = 0, ans = 0;
  for (long long i = 0; i < (long long)n; i++) {
    long long c = str[i] - 'a';
    if (i == 0) {
      sum += val[c];
      if (mp[sum].size() == 0) mp[sum] = al;
      mp[sum][c]++;
    } else {
      if (mp.find(sum) != mp.end()) {
        ans += mp[sum][c];
        if (str[i - 1] == c) ans--;
      }
      sum += val[c];
      if (mp[sum].size() == 0) mp[sum] = al;
      mp[sum][c]++;
    }
  }
  cout << ans << '\n';
}
int32_t main() {
  J27 = 1;
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  INP();
  long long t = 1;
  while (t--) solve();
}
inline void INP() {}
