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.*;
import java.io.*;
import java.lang.*;
import java.util.stream.Collectors;

public class B {
    private static void insertInMap(Map<String, Long> map, String names) {

        if (!map.containsKey(names)) {
                map.put(names, 1l);
        } else {
                map.put(names, map.get(names) + 1l);
        }

    }

    public static void main(String[] args) throws Exception {
        try {

            InputStreamReader isr = new InputStreamReader(System.in);
            BufferedReader br = new BufferedReader(isr);
            String str[] = br.readLine().split("");
            Map<String,Long> map = new TreeMap<>();
            for(String i : str){
                insertInMap(map,i);
            }
            long sum=0;
            for(long val : map.values()){
                sum += val*val;
            }
            System.out.println(sum);


        } catch (Exception e) {
            e.printStackTrace();
        }
    }
}