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 CF_50B {
    public static void main(String[] args) {
        Scanner s = new Scanner(System.in);
        String in = s.nextLine();
        HashMap<Character, Integer> map = new HashMap<Character, Integer>();

        for(int i = 0; i < in.length(); i++) {
            char focus = in.charAt(i);

            if(map.containsKey(focus)) {
                int num = map.remove(focus);
                map.put(focus, num+1);
            } else {
                map.put(focus, 1);
            }
        }

        long sum = 0;
        Iterator it = map.entrySet().iterator();
        while(it.hasNext()) {
            Map.Entry entry = (Map.Entry) it.next();
            sum += (long)(int)entry.getValue() * (long)(int)entry.getValue();
        }

        System.out.println(sum);
    }
}