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()
flag=0
ls=[]
for i in n:
    for k in n:
        ls.append((i,k))
for i in ls:
    for k in ls:
        if i==k:
            flag+=1
print(int(flag**0.5)