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>.
d = str(input())
duplicates = []
t = len(d)
for char in d:
   if d.count(char) > 1:
       if char not in duplicates:
        duplicates.append(char)

for x in range(0, len(duplicates)):
    d += len(d) * d.count(duplicates[x])

print(d)