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 {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		PrintStream out = System.out;
		
		String a = in.next();
		
		Map<Character, Long> map = new HashMap<Character, Long>();
		
		for (int i = 0; i < a.length(); i++) {
			Character c = a.charAt(i);
			if( map.containsKey(c) ){
				map.put( c , map.get(c)+1);
			}else map.put( c , 1l);
		}
		
		long s = 0;
		
		for (long i : map.values()) {
			s += i*i;
		}
		out.print(s);
		
		
		
		in.close();
		out.close();

	}

}