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:
#https://codeforces.com/contest/50/problem/B

import sys
import math

alpha = 'abcdefghijklmnopqrstuvwxyz0123456789'

def main():
    #sys.stdin = open('E:\\Sublime\\in.txt', 'r')
    #sys.stdout = open('E:\\Sublime\\out.txt', 'w')
    #sys.stderr = open('E:\\Sublime\\err.txt', 'w')
    
    s = list(sys.stdin.readline().strip())
    res = 0
    
    for c in alpha:
        res += s.count(c) ** 2
    
    print(res)


    
        


if __name__ == '__main__':
    main()

#hajj