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>.
n=input()
ls=[]
for i in range(len(n)):
    ls.append(n[i])
ls1=set(ls)
if len(ls)==len(ls1):
    print(len(n))
else:
    if len(ls1)==1:
        print(len(n)**2)
    else:
        print((len(ls)-len(ls1))*2**2-len(ls)+2*len(ls1))