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 = str(input())
l = list(s)
l.sort()
counter1 = 0
counter2 = 0
ans = 0
tmp = l[0]
while(counter1 < len(l)):
    tmp = l[counter1]
    counter2 = counter1
    while(counter2 < len(l) and l[counter2] == tmp):
        counter2 += 1
    x = (counter2 - counter1) ** 2
    ans += x
    counter1 = counter2    
print(ans)