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.BufferedReader;
import java.io.InputStreamReader;
import java.util.HashMap;
import java.util.Iterator;
import java.util.Map;
import java.util.Set;

public class Main{

    public static void main(String[] args) throws Exception{
        BufferedReader inp = new BufferedReader(new InputStreamReader(System.in));
        String s = inp.readLine();
        Map<Character, Double> map = new HashMap<Character, Double>();
        
        for(int i = 0; i < s.length(); i++){
            if(!map.containsKey(s.charAt(i)))
                map.put(s.charAt(i), (double) 1);
            else{
                double c = map.get(s.charAt(i));
                map.put(s.charAt(i), ++c);
            }
        }
        Set<Character> setOfKeys = map.keySet();
        Iterator<Character> iter = setOfKeys.iterator();
        
        double sum = 0;
        
        while(iter.hasNext()){
            char ch = iter.next();
            sum += map.get(ch) *  map.get(ch);
        }
        System.out.println(Math.round(sum));
    }

}