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:
//package main;
import java.util.*;
import java.io.*;
import java.math.*;
public class Main {
static StringTokenizer st;
static BufferedReader scan;
static PrintWriter out;
public static void main(String[] args) throws IOException{
   // Scanner scanf = new Scanner(new File("input.txt"));
    //PrintStream outf = new PrintStream(new File("output.txt"));
    scan = new BufferedReader(new InputStreamReader(System.in));
    out = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
    String s = next();
    long[] a = new long[36];
    for(int i = 0; i < s.length(); i++){
        int x = s.charAt(i) - 97;
        if(x < 0){
            x += 49 + 26;
            a[x]++;
        }else{
            a[x]++;
        }
    }
    long ans = 0;
    for(int i = 0; i < 36; i++)ans += (a[i] * a[i]);
    out.println(ans);
    scan.close(); out.close();
    //scanf.close(); outf.close();
}
public static BigInteger nextBigInteger() throws IOException {
    return new BigInteger(next());
}
public static double nextDouble() throws IOException {
    return Double.parseDouble(next());
}
public static long nextLong() throws IOException {
    return Long.parseLong(next());
}
public static int nextInt() throws IOException {
    return Integer.parseInt(next());
}
public static String next() throws IOException{
    while(st == null || !st.hasMoreTokens()){
        st = new StringTokenizer(scan.readLine());
    }
    return st.nextToken();
}
}