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()
arr = []
arr1 = []
for i in S:
    arr.append(i)
    arr1.append(i)
    
counter = 0

for i in range(len(arr)):
    for j in range(len(arr1) - 1, -1, -1):
        if arr[i] == arr1[j]:
            counter+=1
print(counter)
		 				       	   	 	    	  	