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;

/**
 *
 * @author Madi
 */
public class Round47B {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.nextLine();
        String k = "";
        long[] t = new long[1000];
        for (int i = 0; i < 1000; i++) {
            t[i] = 0;
        }
        for (int i = 0; i < s.length(); i++) {
            if (k.contains(s.charAt(i) + "")) {
                t[k.indexOf(s.charAt(i))]++;
            } else {
                k += s.charAt(i);
                t[k.indexOf(s.charAt(i))]++;
            }
        }

        BigInteger res = BigInteger.ZERO;
        for (int i = 0; i < 1000; i++) {
            res = res.add(new BigInteger((t[i] * (t[i] - 1)) + ""));
        }

        if (s.length() > 1) {
            System.out.println(res.add(new BigInteger("" + s.length())));
        } else {
            System.out.println("1");
        }
    }
}