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.math.BigInteger;
import java.util.HashMap;
import java.util.Scanner;


public class _50B {
	
	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		BigInteger count = new BigInteger("0");
		char[] chars = scan.next().toCharArray();
		HashMap<Character, Long> charCount = new HashMap<Character, Long>();
		for (int i = 0; i < chars.length; i++) {
			char c = chars[i];
			if (charCount.containsKey(chars[i])) {
				charCount.put(c, charCount.get(c) + 1);
			}
			else {
				charCount.put(c, 1L);
			}
		}
		for (Character c : charCount.keySet()) {
			long n = charCount.get(c);
			count = count.add(BigInteger.valueOf((n*(n-1)) + n));
		}
		System.out.println(count);
		scan.close();
	}

}