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

public class B_do {

        InputStreamReader inp = new InputStreamReader(System.in);
        BufferedReader in = new BufferedReader(inp);
        boolean test = false;

        String[] inData = { "2323" 
        };
        
        
        public B_do() throws Throwable {
                String line = readLine();
                
                long[] hits = new long[256];
                
                
                for (int i = 0; i < line.length(); i++) {
                        hits[line.charAt(i)] ++;
                }
                
                long sum = 0;
                for (int i = 0; i < hits.length; i++) {
                        
                        sum += hits[i]*hits[i];
                }
                
                System.out.println(sum);
                
        }

        static int id = -1;

        public int[] readInts() throws IOException {
                String[] split = readLine().split(" ");
                int[] ret = new int[split.length];
                for (int i = 0; i < split.length; i++) {
                        ret[i] = Integer.parseInt(split[i]);
                }
                return ret;
        }

        public int readInt() throws IOException {
                return Integer.parseInt(readLine());
        }

        public String readLine() throws IOException {
                id++;
                if (test){
                        return inData[id];
                } else {
                        return in.readLine();
                }       
        }

        public static void main(String[] args) throws Throwable {
                new B_do();
        }
}