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.Scanner;


public class B50 {
	private String ip;
	private Long result = 0L;
	private HashMap<Character, Long> charMap = new HashMap<>();
	
	public static void main(String[] args) {
		B50 obj = new B50();
		
		obj.init();
		obj.compute();
		
		System.out.println(obj.result);
	}
	
	private void init() {
		Scanner scn = new Scanner(System.in);
		ip = scn.nextLine();
	}
	
	private void compute() {
		for(int i = 0;i<ip.length();i++)
		{
			if(charMap.containsKey(ip.charAt(i)))
			{
				charMap.put(ip.charAt(i), charMap.get(ip.charAt(i)) + 1);
			}
			else
				charMap.put(ip.charAt(i), 1L);
		}
		
		for(Long i: charMap.values())
		{
			if(i == 1)
				result++;
			else
			{
				result = result + (i*i);
			}
		}
	}
}