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;

/**
 *
 * @author HI-TECH
 */
public class ChoosingSymbolPairs {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
         final int size = (int) 5e5+5;
      double fr[] = new  double [size];
        double count = 0.0;
        Scanner in = new Scanner(System.in);
       String string = in.next();
        for (int i = 0; i < string.length(); i++) {
            fr[string.charAt(i)]++;
        }
        
        for (int i = 0; i < fr.length; i++) {
           count+=(fr[i]*fr[i]);
//           if (fr[i]!=0) {
//               System.out.println(i);
//                 System.out.println(fr[i]);
//            }
           
        }
        System.out.println(Math.round(count));
    }
    
}