Problem: 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.

Input

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 105.

Output

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.

Examples

Input

great10


Output

7


Input

aaaaaaaaaa


Output

100

Solution (in PYTHON):

Solution:
#def A(k):
#    def foo(n):
#        return reduce(lambda x, y: x*y, xrange(n-k, n+1), 1)
#    return foo

def A(k):
    def foo(n):
        return n**k
    return foo

sl = {}
st = raw_input()
for i in st:
    if sl.has_key(i):
        sl[i] += 1
    else:
        sl[i] = 1
#print sl
print sum(map(A(2), sl.itervalues()))