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.BufferedWriter;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;

public class ChoosingSymbolPairs {

    void run() {
        try {
            BufferedReader bfd = new BufferedReader(new InputStreamReader(
                    System.in));
            BufferedWriter out = new BufferedWriter(new OutputStreamWriter(
                    System.out));
            int ascii[] = new int[256], i;
            String s = bfd.readLine();
            for(i=0; i<s.length(); ++i)
                ++ascii[s.charAt(i)];
            long sum = 0;
            for(i=0; i<256; ++i)
                sum += Math.pow(ascii[i], 2);
            out.write(sum+"\n");
            out.flush();
            out.close();
        } catch (Exception e) {
        }
    }

    public static void main(String[] args) {
        new ChoosingSymbolPairs().run();
    }

}