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 S50B{
	public static void main(String[] args) {
		Scanner sc=new Scanner(System.in);
		char[] c=sc.next().toCharArray();
		int[] ar=new int[26];
		int[] number=new int[10];
		int n=c.length;
		for(int i=0;i<n;i++)
		{
			int x=(int)c[i];
			if(x>=48 && x<=57)
			{
              number[c[i]-'0']++;
			}
			else
			{
				ar[c[i]-'a']++;
			}
		}
		long ans=0;
		for(int i=0;i<n;i++)
		{
			int x=(int)c[i];
			if(x>=48 && x<=57)
			{
               ans+=(long)number[c[i]-'0'];
			}
			else
			{
				ans+=(long)ar[c[i]-'a'];
			}
		}

		System.out.println(ans);
	}
}