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.
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 10<sup class="upper-index">5</sup>.
arr = list(input())
dict1 = {}
ans=0
for i in range(len(arr)):
  if(arr[i] in dict1):
    dict1[arr[i]]+=1
  else:
    dict1[arr[i]]=1
for x in dict1:
  ans+= (dict1[x]**2)
print(ans)
  
