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

public class spairs {
    public static void main(String[] args) {
        Scanner br = new Scanner(System.in);
        String line = br.next();
        long[] freq = new long[36];
        for(int i = 0;i<line.length();i++){
        	if(line.charAt(i) <= '9' && line.charAt(i) >='0'){
        		freq[line.charAt(i)-'0']++;
        	}
        	else{
        		freq[line.charAt(i)-'a'+10]++;
        	}
        }
        long count = 0;
        for(int i = 0;i<36;i++){
        	count+=(freq[i]*freq[i]);
        }
        System.out.println(count);
    }
}