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 javax.print.attribute.IntegerSyntax;

import java.io.*;
public class Problem {
	public static void main(String[] args)throws IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));
		String input = br.readLine();
		HashMap<Character, Long> map = new HashMap<Character, Long>();
		for(int i = 0; i < input.length(); i++){
			char c = input.charAt(i);
			if(!map.containsKey(c)) map.put(c, 1L);
			else map.put(c, map.get(c) + 1);
		}
		long total = 0;
		for(Long i : map.values()){
			total += i * i;
		}
//		StringBuilder s = new StringBuilder();
//		for(int i = 0; i < Math.pow(10, 5); i++){
//			s.append("c");
//		}
//		System.out.println(s);
		out.println(total);
		out.close();
	}
}