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.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.HashMap;

public class Main {
    public static void main(String[] args) throws IOException {
        BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
        String line = "";
        StringBuilder out = new StringBuilder();
        while ((line = in.readLine()) != null && line.length() != 0) {
            long ans = 0, ret = 0;
            ArrayList<Character> dif = new ArrayList<Character>(100);
            HashMap<Character, Integer> map = new HashMap<Character, Integer>(
                    100);
            char[] array = line.toCharArray();
            for (int i = 0; i < array.length; i++) {
                if (!map.containsKey(array[i])) {
                    dif.add(array[i]);
                    map.put(array[i], 1);
                } else
                    map.put(array[i], map.get(array[i]) + 1);
            }
            for (int i = 0; i < dif.size(); i++) {
                ret = map.get(dif.get(i));
                ans += (ret * ret);
            }
            out.append(ans+"\n");
        }
        System.out.print(out);
    }
}