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.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.IOException;




public class Main
{
 
    public static void main (String[] args) throws IOException
    {
        
  BufferedReader in;
  in =new BufferedReader(new InputStreamReader(System.in));
 
  long freq[]=new long [26];
  long freq1[]=new long [26];
  StringBuilder inp;
  char arr[]=in.readLine().toCharArray();
  
  for (int i=0;i<arr.length;i++){
    if ((arr[i])>=97)
    freq[arr[i]-'a']++;
    else
        freq1[arr[i]-'0']++;
  }
  for (int i=0;i<26;i++)
  {
  if (freq[i]>1)freq[i]*=freq[i];
  if (freq1 [i] >1) freq1[i]*=freq1[i];
  }
        System.out.println((long)(sum(freq)+sum(freq1)));
    }

    
    public static long sum(long []rr)
    {
        long sum=0;
        for (int i=0;i<rr.length;i++)
            sum+=rr[i];
        return sum;
    }
}