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 PYTHON3):

Solution:
import random
import math
a = input()


l = len(a)

li = []
for i in range(0,l):
    li.append(a[i])

li.append('+')
li.sort()
li.reverse()
com = 1
list = []
for i in range(0,l):
    if li[i] == li[i + 1]:
        com += 1
        if i == l:
            list.append(com)
    else:
        list.append(com)
        com = 1

total = 0    
for i in range(0,len(list)):
    if list[i] == 1:
        total = total + 1
    else:
        total = total + (list[i] * list[i])

print(total)