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

    BufferedReader in;
    PrintWriter out;

    public static void main(String[] args) throws Exception {
        new Solution().run();
    }

    public void run() throws Exception {
        in = new BufferedReader(new InputStreamReader(System.in));
        out = new PrintWriter(new OutputStreamWriter(System.out));
        solve();
        out.flush();
    }

   /* String next() throws Exception {
        in.nextToken();
        return in.sval;
    }*/

    public void solve() throws Exception {
        String s=in.readLine();
        long ans=0;
        long [] a =new long [300];
        for (int i=0; i<s.length(); i++)
            a[(int)s.charAt(i)]++;
        for (int i=0; i<a.length;i++)
            ans +=a[i]*a[i];
        out.println(ans);
    }

}