Problem: There is a given string S consisting of N symbols. Your task is to find the number of ordered pairs of integers i and j such that

1. 1 ≤ i, j ≤ N

2. S[i] = S[j], that is the i-th symbol of string S is equal to the j-th.

Input

The single input line contains S, consisting of lowercase Latin letters and digits. It is guaranteed that string S in not empty and its length does not exceed 105.

Output

Print a single number which represents the number of pairs i and j with the needed property. Pairs (x, y) and (y, x) should be considered different, i.e. the ordered pairs count.

Examples

Input

great10


Output

7


Input

aaaaaaaaaa


Output

100

Solution (in PYTHON3):

Solution:
s = input()

alphabet_and_digit = []
for i in range(0, 11):
    alphabet_and_digit.append(str(i))
for i in range(11, 37):
    alphabet_and_digit.append(chr(ord('a')+i-11))

distinct_element = []
for i in range(37):
    distinct_element.append(0)
for i in range(len(s)):
    distinct_element[alphabet_and_digit.index(s[i])] += 1
cnt = 0
for i in range(37):
    cnt += distinct_element[i]**2

print(cnt)