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

/**
 * Created by sayeed on 10/22/17.
 */
public class B050 {
    private final String str;
    private long occurences[];
    public B050(String a) {
        this.str = a;
        occurences = new long[80];
    }

    public long getOrderedPairCount() {

        for (int i = 0; i < str.length(); i++) {
            occurences[str.charAt(i) - '0']++;
        }

        return Arrays.stream(occurences).reduce(0, (left, right) -> left + right * right);
    }

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

        System.out.println(result);
    }

}