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.Arrays;
import java.util.Scanner;

public class Main {

    private static void run(int n, char[] arr) {
        Arrays.sort(arr);
        long sum = 0;
        char current = arr[0];
        long count = 0;

        for (int i = 0; i < n; i++) {
            if (arr[i] == current) {
                count++;
            } else {
                sum += count * count;
                current = arr[i];
                count = 1;
            }

            if (i + 1 == n) {
                sum += count * count;
            }
        }
        System.out.println(sum);
    }

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        char[] arr = scanner.nextLine().toCharArray();
        Main.run(arr.length, arr);
    }
}