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>.
string=list(map(str,input()))
a=list(set(string))
len1=len(string)
len2=len(a)
count1=[]
for i in range(len2):
    count2=string.count(a[i])
    count1.append((count2*count2))
print(sum(count1))
				 		 	 	 				   	  		  		