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.BufferedReader;
import java.io.IOError;
import java.io.IOException;
import java.io.InputStreamReader;

public class ChoosingSymbolPairs {
	static long[] lf = new long[26];
	static long[] df = new long[10];

	public static void main(String[] args) throws IOException {
		BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
		String s = bf.readLine();
		char[] ch = s.toCharArray();
		long ans = 0;
		for (char c : ch) {
			if (c >= 'a' && c <= 'z')
				lf[c - 'a']++;
			else
				df[Integer.parseInt(c + "")]++;
		}
		for (int i = 0; i < 26; i++)
			ans += (lf[i] * lf[i]);
		for (int i = 0; i < 10; i++)
			ans += (df[i] * df[i]);
		
		System.out.println(ans);
	}
}