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>.
s = input()
t = {}
p = 0
z = 0
for i in s:
  if i in t:
    t[i]+= 1
  else:
    t[i] = 1
for k in t:
  if t[k] > 1:
    p = int(t[k])**2
    z += p
if(t[k] == 1):
  print(len(s))
else:
  print(z)