A and B are preparing themselves for programming contests.

After several years of doing sports programming and solving many problems that require calculating all sorts of abstract objects, A and B also developed rather peculiar tastes.

A likes lowercase letters of the Latin alphabet. He has assigned to each letter a number that shows how much he likes that letter (he has assigned negative numbers to the letters he dislikes). 

B likes substrings. He especially likes the ones that start and end with the same letter (their length must exceed one).

Also, A and B have a string *s*. Now they are trying to find out how many substrings *t* of a string *s* are interesting to B (that is, *t* starts and ends with the same letter and its length is larger than one), and also the sum of values of all letters (assigned by A), except for the first and the last one is equal to zero.

Naturally, A and B have quickly found the number of substrings *t* that are interesting to them. Can you do it?
The first line contains 26 integers *x*<sub class="lower-index">*a*</sub>, *x*<sub class="lower-index">*b*</sub>, ..., *x*<sub class="lower-index">*z*</sub> ( - 10<sup class="upper-index">5</sup> ≤ *x*<sub class="lower-index">*i*</sub> ≤ 10<sup class="upper-index">5</sup>) — the value assigned to letters *a*, *b*, *c*, ..., *z* respectively.

The second line contains string *s* of length between 1 and 10<sup class="upper-index">5</sup> characters, consisting of Lating lowercase letters— the string for which you need to calculate the answer.
import itertools
import math
import threading
import time
from builtins import input, range
from math import gcd as gcd
import sys
from io import BytesIO, IOBase
import queue
import itertools
import collections
from heapq import heappop, heappush
import random
import os
from random import randint
import decimal
from math import factorial as fac


def solve():
    x = list(map(int, input().split()))
    s = str(sys.stdin.readline()[:-1])

    best_for = [{} for i in range(26)]
    res = 0
    cur_score = 0

    for i in s:
        f = ord(i) - 97

        if cur_score in best_for[f]:
            res += best_for[f][cur_score]

        cur_score += x[f]
        if cur_score not in best_for[f]:
            best_for[f][cur_score] = 1
        else:
            best_for[f][cur_score] += 1

    print(res)


if __name__ == '__main__':
    multytest = False

    if multytest:
        t = int(input())
        for i in range(t):
            solve()
    else:
        solve()
