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.Scanner;
public class ChoosingSymbolPairs{

    public static void main(String[] args){
	
	Scanner sc = new Scanner(System.in);
	String input = sc.nextLine();
	int size = input.length();
	long count = 0;
	long[] memo_alpha = new long[26];
	long[] memo_number = new long[10];

	for(int i=0; i<size; i++){
	    int ch = input.charAt(i);
	    if(Character.isDigit(ch)){
		memo_number[Character.digit(ch,10)]++;
	    }else{
		memo_alpha[ch-97]++;
	    }
	}
	for(int i=0; i<10; i++){
	    count += memo_number[i] * memo_number[i];
	}
	for(int i=0; i<26; i++){
	    count += memo_alpha[i] * memo_alpha[i];
	}
	System.out.println(count);
    }

}