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.*;
public class Problem0050b {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        TreeMap<Character, Long> tm = new TreeMap<>();
        String s = sc.next();
        long ans = 0;
        ArrayList<Character> list = new ArrayList<>();
        for(int i = 0; i < s.length(); i++) {
            list.add(s.charAt(i));
        }
        for (Character t : list) {
            Long c = tm.get(t);
            tm.put(t, (c == null) ? 1 : c + 1);
        }
        List<Long> values = new ArrayList<>();
        for (Map.Entry m : tm.entrySet()) {
            values.add((Long)m.getValue());
        }
        for(int i = 0; i < values.size(); i++) {
            ans += values.get(i) * values.get(i);
        }
        System.out.println(ans);
    }
}