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.HashMap;

public class Problem2 {

    public static void main(String[] args) throws IOException {
        BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
        String input = reader.readLine();

        long count = 0;
        int c;
        HashMap<Character, Integer> htbl = new HashMap<>();
        for (int i = 0; i < input.length(); ++i) {
            if (!htbl.containsKey(input.charAt(i))) {
                htbl.put(input.charAt(i), 1);
                count++;
            } else {
                c = htbl.get(input.charAt(i));
                count += c * 2 + 1;
                htbl.replace(input.charAt(i), c + 1);

            }
        }

        System.out.println(count);
    }
}