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

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        long[] tab = new long[128];
        String ch = in.next();
        boolean test = true;
        for (int i = 0; i < ch.length(); i++) {
            tab[ch.charAt(i)]++;         
            if (i>0 && test) {
                if (ch.charAt(i)!=ch.charAt(i-1)) test = false; 
            }
        }
        if (test) System.out.println(Math.round(Math.pow(ch.length(), 2)));
        else {
            double s = 0;
            for (int i = 0; i < tab.length; i++) {
                s+=(tab[i]*tab[i]);            
            }
            System.out.println(Math.round(s));
        }
    }
    
}