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())
k=1
arr=[]
res=0
test='qwertyuiopasdfghjklzxcvbnm0123456789'
for i in range(len(s)):
    arr.append(s[i])
arr.sort()
fl=True
i=0
while i <(len(arr)-1) and fl:
    if arr[i+1]==arr[i]:
        k+=1
    else:
        res=res+(k*k)
        k=1
    if i==len(arr)-2:
        fl=False
    if fl==False:
        res=res+(k*k)
    i+=1
if i==0:
    res=1
print(res)