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()
ls1=[]
ls2=[]
a={}
t=0
for i in range(len(s)):
    ls1.append(s[i])
for i in range(len(s)):
    a[ls1[i]]=a.get(ls1[i],0)+1


ls1=list(set(ls1))
for i in range(len(ls1)):
    ls2.append(a[ls1[i]])

for i in ls2:
    i=int(i)
    if i!=1:
        t+=i**2
    else:
        t+=1
print(t)