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.Arrays;
import java.util.Scanner;

public class Choosing_Symbol_Pairs {

    public static void main(String[] args) {
        Scanner s = new Scanner (System.in);
        String inp = s.next();
        char[] a = inp.toCharArray();
        Arrays.sort(a);
        long count,sum=0;
        for (int i=0;i<a.length;){
            count=1;
            while (++i < a.length){
                if (a[i]==a[i-1]) count++;
                else break;
            }
            sum += count*count;
        }
        System.out.println(sum);
    }

}