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.util.Map.Entry;

import static java.lang.Math.*;

public class Main {

    static Scanner sc = new Scanner(System.in);
    static String s;
    
    public static void main(String[] args) {
        s = sc.next();
        
        HashMap<Character, Integer> hist = new HashMap<Character, Integer>();
        
        for(int i = 0; i < s.length(); i++) {
            char c = s.charAt(i);
            if(hist.containsKey(c)) {
                hist.put(c, hist.get(c) + 1);
            } else {
                hist.put(c, 1);
            }
        }
        
        long ans = 0;
        for(Entry<Character, Integer> e : hist.entrySet()) {
            ans += pow(e.getValue(), 2);
        }
        System.out.println(ans);
    }

}