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

Solution:
import java.io.*;
import java.util.*;

public class ChoosingSymbolPairs {

    public static void main( String[] args ) throws Exception {
        BufferedReader br = new BufferedReader( new InputStreamReader( System.in ) );
        String s = br.readLine();
        Map<Character, Integer> map = new HashMap<Character, Integer>();
        for ( char c : s.toCharArray() ) {
            Integer cnt = map.get( c );
            if ( cnt == null )
                cnt = 0;
            ++cnt;
            map.put( c, cnt );
        }
        long sum = 0;
        for ( long x : map.values() )
            sum += x*x;
        
        System.out.println( sum );
    }

}