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

public class File1{
	public static void main(String[] args){
		Scanner in = new Scanner(System.in);
		String s = in.next();
		HashMap<Character,Integer> map = new HashMap<Character,Integer>();
		for(int i=0;i<s.length();i++){
			if(map.get(s.charAt(i))==null)
				map.put(s.charAt(i), 1);
			else map.put(s.charAt(i), map.get(s.charAt(i))+1);
		}
		long ans = 0;
		Set<Character> set = map.keySet();
		for(char c:set){
			long d = map.get(c);
			ans+=d*d;
		}
		System.out.println(ans);
	}
}