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>.
# LUOGU_RID: 103336858
n=str(input())
z={}
x=0
nl=int(len(n))
for i in range(nl):
    if n[i] in z:
        z[n[i]]=z[n[i]]+1
    else:
        z[n[i]]=1
for value in z:
    x+=z[value]**2
print(x)