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.util.*;
public class B47 {
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        String str ="";
        str = sc.nextLine();

        TreeMap<Character,Integer> tm = new TreeMap<Character,Integer>();
        long total_count = 0 ;

        if(str.length() > 0 && str.length() <= Math.pow(10,5)){
        for(int i=0;i<str.length();i++){
            int count =0;
            if(tm.containsKey(new Character(str.charAt(i))) == false){
                for(int j=0;j<str.length();++j){
                    if(str.charAt(i) == str.charAt(j)){
                        count += 1;
                    }
                }
                tm.put(new Character(str.charAt(i)),new Integer(count));
            }
            total_count += tm.get(str.charAt(i));
        }
    }
    System.out.println(total_count);
}
}