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.*;
public class j2{
    public static void main(String args[]){
        Scanner sc=new Scanner(System.in);
        String str=sc.next();
        char ch[]=str.toCharArray();
        Arrays.sort(ch);
        int n=ch.length;
        long ans=n;
        long tmp=0;
        for(int i=1;i<n;i++){
            if(ch[i]==ch[i-1])
                tmp++;
            else{
                long k=(tmp*(tmp+1)/2);
                ans+=(2*k);
                tmp=0;
            }

        }
        long k=(tmp*(tmp+1)/2);
        ans+=(2*k);
        System.out.println(ans);

    }

}