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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;


public class p50b {
    public static void main(String[] args) throws IOException {
        BufferedReader in  = new BufferedReader(new InputStreamReader(System.in));
        String s = in.readLine();
        char[] all  =s.toCharArray();
        long[] letters = new long[26];
        long[] numbers = new long[10];
        
        for (int i = 0; i < all.length; i++) {
            if(all[i]>='0'&&all[i]<='9')
            {
                numbers[all[i]-'0']++;
                continue;
            }
            letters[all[i]-'a']++;
        }
        long total = 0;
        for (int i = 0; i < numbers.length; i++) {
            total += numbers[i]*(numbers[i]-1) + numbers[i];
            
        }
        for (int i = 0; i < letters.length; i++) {
            total += letters[i]*(letters[i]-1)+letters[i];
        }
        System.out.println(total);
    }
}