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.*;
import java.util.*;
public class ChoosingSymbolPairs 
{
    public static void main(String[] args) throws IOException
    {
        //Locale.setDefault (Locale.US);
        Reader in = new Reader();
        StringBuilder out = new StringBuilder();
        int[] letters, digits;
        String s;
        long sum;
        
        for (int i = 0; i < 1; i++) {
            s = in.next();
            letters = new int[26];
            digits = new int[10];
            for (int j = 0; j < s.length(); j++) {
                if(Character.isAlphabetic(s.charAt(j)))
                    letters[s.charAt(j)-'a']++;
                else 
                    digits[s.charAt(j)-'0']++;
            }
            
            sum = 0;
            for (int j = 0; j < digits.length; j++) 
                sum += digits[j]*1L*digits[j];
            for (int j = 0; j < letters.length; j++) 
                sum += letters[j]*1L*letters[j];
            
            System.out.println(sum);
            
        }
    }
    static class  Reader 
    {
        BufferedReader br;
        StringTokenizer st;
        Reader() { // To read from the standard input
            br = new BufferedReader(new InputStreamReader(System.in));
        }
        Reader(int i) throws IOException { // To read from a file
            br = new BufferedReader(new FileReader("Sample Input.txt"));
        }
       String next() throws IOException {
          while (st == null || !st.hasMoreTokens())
             st = new StringTokenizer(br.readLine());
          return st.nextToken();
       }
       int nextInt() throws IOException { return Integer.parseInt(next()); }
       long nextLong() throws IOException { return Long.parseLong(next()); }
       double nextDouble() throws IOException { return Double.parseDouble(next()); }
       String nextLine() throws IOException { return br.readLine(); }
    }

}