Problem2531--Choosing Symbol Pairs

2531: Choosing Symbol Pairs

Time Limit: 2 Sec  Memory Limit: 256 MB
Submit: 0  Solved: 0
[Submit] [Status] [Web Board] [Creator:]

Description

time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

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

Source/Category

 
[Submit] [Status]