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

public class SolutionB{
	
	public static void main(String[] args){
		
		Scanner sc = new Scanner(System.in);
		String S = sc.next();
		long ans = 0;
		int[] letters = new int[26];
		int[] digits = new int[10];
		for(int i = 0 ; i < S.length() ; i++){
			char c = S.charAt(i);
			if(isChar(c)) letters[c - 'a']++;
			if(isDigit(c)) digits[c - '0']++;
		}
		for(int i = 0 ; i < 26 ; i++){
			ans += (long)(letters[i]) * (letters[i]);
		}
		
		for(int i = 0 ; i < 10 ; i++){
			ans += (long)(digits[i]) * (digits[i]);
		}
		
		System.out.println(ans);
	}
	
	public static boolean isChar(char c){
		return c >= 'a' && c <= 'z';
	}
	
	public static boolean isDigit(char c){
		return c >= '0' && c <= '9';
	}
	
}