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.math.BigInteger;
import java.util.*;

public class B {
    public static void main(String[] args) throws Exception{
        Scanner sc = new Scanner(System.in);
        StringBuilder SB = new StringBuilder();
        String in = sc.next();
        long[] thing = new long[128]; 
        for(int a=0;a<in.length();a++){
            thing[in.charAt(a)]++;
        }
        BigInteger total = new BigInteger("0");
        for(int a=0;a<128;a++){
        
        total=total.add(BigInteger.valueOf(thing[a]*thing[a]));}
        System.out.print(total.toString());
    }
}