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 Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        long counter = 0;
        int []arr=new int[10];
        int []arrr=new int[28];
        String news;
        news = sc.nextLine();

        for (int i = 0; i < news.length(); i++) {
            if('a'<=news.charAt(i) && news.charAt(i)<='z'){

                counter+=(arrr[news.charAt(i)-'a']*2)+1;
                arrr[news.charAt(i)-'a']++;

            }else {

                counter+=(arr[news.charAt(i)-'0']*2)+1;
                arr[news.charAt(i)-'0']++;

            }
        }
        System.out.println(counter);
    }
}