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.ArrayList;
import java.util.Scanner;

public class SymbolPairs
{
	private static Scanner scanner = new Scanner(System.in);
	
	public static void main(String[] args)
	{
		String string = scanner.nextLine();
		int tam_string = string.length();
		
		long pares = tam_string;
		
		ArrayList<Character> str_char = new ArrayList<>();
		
		int[] count_char = new int[36];
		
		char c;
		int i;
		
		for (i = 0; i < tam_string; i++)
		{
			c = string.charAt(i);
			
			if (str_char.contains(c))
				pares += 2 * count_char[str_char.indexOf(c)];
			
			else
				str_char.add(c);
			
			count_char[str_char.indexOf(c)]++;
		}
		
		System.out.println(pares);
		
		scanner.close();
	}

}