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.InputStream;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
import java.util.HashMap;
public class om {
    public static void main(String[] args)throws IOException {
        FastScanner sc=new FastScanner(System.in);
        HashMap<Character,Integer>map=new HashMap<>();
        String x=sc.next();
        for(int i=0;i<x.length();i++){
            if(!map.containsKey(x.charAt(i))){
                map.put(x.charAt(i),1);
            }
            else{
                map.put(x.charAt(i),map.get(x.charAt(i))+1);
            }
        }
        long ans=0;
        for(int c=0;c<x.length();c++){
            if(map.containsKey(x.charAt(c))){
                ans=ans+(long)Math.pow(map.get(x.charAt(c)),2);
                map.remove(x.charAt(c));
            }
        }
        System.out.println(ans);
    }
    static class FastScanner {
        BufferedReader br;
        StringTokenizer st;

        public FastScanner(InputStream i) {
            br = new BufferedReader(new InputStreamReader(i));
            st = new StringTokenizer("");
        }
        public String next() throws IOException {
            if (st.hasMoreTokens())
                return st.nextToken();
            else
                st = new StringTokenizer(br.readLine());
            return next();
        }
        public int nextInt() throws IOException {
            return Integer.parseInt(next());
        }
        public long nextLong() throws IOException {
            return Long.parseLong(next());
        }
        public double nextDouble() throws IOException {
            return Double.parseDouble(next());
        }
    }
}