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

public class prn_ChoosingSymbolPairs {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner s=new Scanner(System.in);
		String cad1=s.nextLine();
		Map<Character, Integer>Mapa = new HashMap<Character, Integer>();
		for(int k=0;k<cad1.length();k++){
			if(Mapa.containsKey(cad1.charAt(k))){
				Mapa.put(cad1.charAt(k), Mapa.get(cad1.charAt(k))+1);
			}else
				Mapa.put(cad1.charAt(k), 1);
		}
		long Suma=0;
		Object[]ds=Mapa.keySet().toArray();
		for(int k=0;k<Mapa.size();k++){
			Suma+=Math.pow(Mapa.get(ds[k]),2);
		}
		System.out.println(Suma);
	}
}