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:
/*package whatever //do not write package name here */

import java.io.*;
import java.util.*;
public class S {
	public static void main (String[] args) {
		Scanner in=new Scanner(System.in);
		String s=in.next();
		Map<Character,Long> map=new HashMap<>();
		for(int i=0;i<s.length();i++)
		{
		    char ch=s.charAt(i);
		    if(!map.containsKey(ch))map.put(ch,(long)1);
		    else map.put(ch,map.get(ch)+1);
		}
		long res=0;
		Set<Map.Entry<Character,Long>> set=map.entrySet();
		for(Map.Entry<Character,Long> m:set)
		{
		    res+=(m.getValue()*m.getValue());
		}
		System.out.print(res);
	}
}