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

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

/**
 *
 * @author madis
 */
public class Pair {
    public static void main(String [] args){
        Scanner in = new Scanner(System.in);
        String str = in.nextLine();
        int a[] = new int[300];
        for(int i = 0;i<str.length();i++){
            a[str.charAt(i)]++;
        }
        BigInteger res = BigInteger.ZERO;
        for(int i = 0;i<300;i++){
            if(a[i]!=0){
                res = res.add(comb(a[i]));
            }
        }
        System.out.println(res.toString());
    }
    static BigInteger comb(int n){
        if(n==1)return new BigInteger("1");
        return (new BigInteger(""+n)).multiply(new BigInteger(""+(n-1))).add(new BigInteger(""+n));
    }
}