CF50B Choosing Symbol Pairs

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

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^{5} $ .

Print a single number which represents the number of pairs $ i $ and $ j $ with the needed property. Pairs $ (x,y) $ and $ (y,x) $ should be considered different, i.e. the ordered pairs count.