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.*;
import java.lang.*;
import java.io.*;
public class Choosing_Symbol_Pairs {

	public static void main(String[] args)throws java.lang.Exception{
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		String s=br.readLine();
		Map<Character,Integer> m=new HashMap<>();
		for(int i=0; i<s.length(); i++) {
			if(m.containsKey(s.charAt(i))) m.put(s.charAt(i), m.get(s.charAt(i))+1);
			else m.put(s.charAt(i),1);
		}
		long ans=0;
		for(Character c: m.keySet()) ans+=Math.pow(m.get(c), 2);
		System.out.println(ans);
	}

}