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>.
inp = input().lower()
inp = sorted(inp)
print(inp)
count = []
pairs = 0

repeated_letter = inp[0]
count.append(0)
for i,l in enumerate(inp):
    if(repeated_letter==l):
        count[len(count)-1]+=1
    else:
        count.append(1)
        repeated_letter = inp[i]

for i in count:
    pairs += i**2
print(pairs)
 		   	     						    	     			