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.util.HashMap;
import java.util.Iterator;
import java.util.Map.Entry;
import java.util.Scanner;

public class ChoosingSymbolPairs {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		String in = sc.next();
		HashMap<Character, Long> map = new HashMap<Character, Long>();
		for (int i = 0; i < in.length(); i++) {
			if (!map.containsKey(in.charAt(i))) {
				map.put(in.charAt(i), (long) 1);
			} else {
				map.put(in.charAt(i), map.get(in.charAt(i)) + 1);
			}
		}
		long counter = 0;
		Iterator<Entry<Character, Long>> it = map.entrySet().iterator();
		while (it.hasNext()) {
			Entry<Character, Long> et = (Entry<Character, Long>) it.next();
			long value = (Long) et.getValue();
			if (value == 1)
				counter++;
			else
				counter += (value * value);
		}
		System.out.println(counter);
	}
}