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()
counts={}
for i in S:
    counts[i]=counts.get(i,0)+1
items=list(counts.items())
for j in range(n+1):
    i,count=items[j]
n=len(items)
if j=1:
    m=1
else:
    m=j**2
print(m)