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 whatever; // don't place package name! */

import java.util.*;
import java.lang.*;
import java.io.*;

/* Name of the class has to be "Main" only if the class is public. */
public class Main
{
	public static void main (String[] args) throws java.lang.Exception
	{
		// your code goes here
		BufferedReader in =new BufferedReader(new InputStreamReader(System.in));
		String main = in.readLine();
		int n = main.length();
		int[] check = new int[n];
		long ans = 0;
		long count;
		for(int i=0;i<n;i++){
			if(check[i]==0){
			count =0;
			for(int j = i;j<n;j++){
				
					if(main.charAt(i)==main.charAt(j)) {
						check[j]=1;
						count+=1;
					}
				}
			
			ans += count*count;
			}
		}
		System.out.println(ans);
	}
}