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>.
# LUOGU_RID: 96299729
s = input()
s1 = set(s)
s2 = list(s)
a = len(s1)
b = len(s2)
tong = s2 - s1 + 1
m = b - tong + tong**2
print(m)