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 Main {
    public static void main(String[] args) throws Exception{
        BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
        String s = bf.readLine();
        long antwort = 0;
        TreeMap<Character, Long> counts = new TreeMap();
        for(int a = 0; a < s.length(); a++)
        {
            if(counts.get(s.charAt(a)) == null)
                counts.put(s.charAt(a), 1L);
            else
                counts.put(s.charAt(a), counts.get(s.charAt(a))+1);
        }
        for (Map.Entry<Character, Long> entry : counts.entrySet()) {
            antwort += entry.getValue()*entry.getValue();
        }
        System.out.println(antwort);
    }
}