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

public class pairs {

	public static void main(String[] args) {
		Scanner sc=new Scanner(System.in);
		HashMap<Character,Integer> map=new HashMap<Character, Integer>();
		String str=sc.next();
		long ans=0;
		for(int x=0;x<str.length();x++)
		{
			if(map.containsKey(str.charAt(x)))
			{
				map.put(str.charAt(x), map.get(str.charAt(x))+1);
			}
			else map.put(str.charAt(x),1);
		}
		for(char c:map.keySet())
			ans+=go(map.get(c))+map.get(c);
		System.out.println(ans);
	}
	public static long go(long a)
	{
		return a*(a-1);
	}
}