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>.
n=input()
ls=[]
for i in n:
    ls.append(i)
mm=0
l=len(ls)
m=0
for i in range(len(ls)):
    if ls!=[]:
        mm=mm+(ls.count(ls[-1]))**2
        m=ls.count(ls[-1])
        w=ls[-1]
        for e in range(m):
            ls.remove(w)
    else:
        break
print(mm)