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


public class ChoosingSymbolPairs
{
	public Scanner in;
	public PrintWriter out;
	
	ChoosingSymbolPairs()
	{
		in = new Scanner(System.in);
		out = new PrintWriter(System.out);
	}
	
	ChoosingSymbolPairs(String o) throws FileNotFoundException
	{
		in = new Scanner(System.in);
		out = new PrintWriter(new File(o));
	}
	
	ChoosingSymbolPairs(String i, String o) throws FileNotFoundException
	{
		in = new Scanner(new File(i));
		out = new PrintWriter(new File(o));
	}
	
	public void finalize()
	{
		out.flush();
		in.close();
		out.close();
	}
	
	public void solve()
	{
		Map<Character, Long> map = new HashMap<Character, Long>();
		String s = in.next();
		long co = 0;
		
		for(int i = 0; i < s.length(); ++i)
		{
			char c = s.charAt(i);
			map.put(c, map.get(c) == null ? 1 : map.get(c) + 1);
		}
		
		for(Map.Entry<Character, Long> e : map.entrySet())
		{
			long v = e.getValue();
			co += v * v;
		}
		
		out.println(co);
	}
	
	public static void main(String[] args) throws FileNotFoundException
	{
		ChoosingSymbolPairs t = new ChoosingSymbolPairs();
		t.solve();
		t.finalize();
	}
}