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 Main {

    static BufferedReader br;
    static PrintWriter out;
    static StringTokenizer st;

    static class Pair implements Comparable<Pair>{
        int start;
        int end;
        
        Pair(int s, int e){
            start = s;
            end = e;
        }
        
        @Override
        public int compareTo(Pair that) {
            if(this.start > that.start){
                return -1;
            }else if(this.start < that.start){
                return 1;
            }else{
                if(this.end > that.end){
                    return 1;
                }else if(this.end < that.end){
                    return -1;
                }else{
                    return 0;
                }
            }
        }
        
        public String toString(){
            return start + " " + end;
        }
    }
    
    static void solve() throws Exception {
        String s = next();
        int n = s.length();
        int m = 255;
        long[] memo = new long[m];
        for(int i = 0; i < n; i++){
            memo[s.charAt(i)]++;
        }
        long cnt = 0;
        for(int i = 0; i < m; i++){
            cnt += memo[i] * memo[i];
        }
        out.println(cnt);
    }

    static int nextInt() throws IOException {
        return Integer.parseInt(next());
    }

    static long nextLong() throws IOException {
        return Long.parseLong(next());
    }

    static double nextDouble() throws IOException {
        return Double.parseDouble(next());
    }

    static String next() throws IOException {
        while (st == null || !st.hasMoreTokens()) {
            String line = br.readLine();
            if (line == null) {
                return null;
            }
            st = new StringTokenizer(line);
        }
        return st.nextToken();
    }

    public static void main(String[] args) {
        try {
            br = new BufferedReader(new InputStreamReader(System.in));
            out = new PrintWriter(new PrintStream(System.out));
            solve();
            out.close();
            br.close();
        } catch (Throwable t) {
            t.printStackTrace();
        }
    }

}