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.math.*;
public class Sol
{
    public static void main(String ar[])
    {
        String St;
        Scanner s=new Scanner(System.in);
        St=s.next();
        Map<Character,Integer> res=new HashMap<Character,Integer>();
        for(int i=0;i<St.length();i++)
        {
            if(res.containsKey(St.charAt(i)))
            {
                res.put(St.charAt(i),res.get(St.charAt(i))+1);
            }
            else res.put(St.charAt(i),1);
        }
        long res1=0;
        Iterator<Map.Entry<Character, Integer>> itr = res.entrySet().iterator(); 
        while(itr.hasNext()) 
        { 
             Map.Entry<Character, Integer> entry = itr.next(); 
             long d=entry.getValue(); 
             res1+=d*d;
        }
        System.out.println(res1);
    }
}