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;


public class Prob050B
{
    public static void main( String[] Args )
    {
        Scanner scan = new Scanner( System.in );
        String s = scan.next();
        long[] occurances = new long[36];

        for ( int x = 0; x < s.length(); x++ )
        {
            char c = s.charAt( x );
            if ( c >= 'a' )
                occurances[c - 'a']++;
            else
                occurances[26 + c - '0']++;
        }

        long ans = 0;
        for ( long x : occurances )
            ans += x * x;

        System.out.println(ans);
    }
}