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 {

	/**
	 * @author hunglee
	 */
	public static void main(String[] args) throws IOException {

		Scanner in = new Scanner(System.in);
		
		int[] num = new int[36];
		String s = in.next();
		int j;
		for (int i = 0; i < s.length(); ++i) {
			j = s.charAt(i);
			if ('0' <= j && j <= '9')
				num[j - '0']++;
			else
				num[j - 'a' + 10]++;
		}
		long res = 0;
		for (int i = 0; i < 36; ++i)
			res += ((long) num[i] * num[i]);
		System.out.println(res);
	}

}