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.io.*;
import java.util.*;
	public class B50{
	public static void main(String args[]){
	Scanner in=new Scanner (System.in);
	String a=in.next();
	ArrayList <String> b=new ArrayList<String>();
	ArrayList <Long> c=new ArrayList<Long>();	
	long d=0l;
	int i,j;
	for (i=0;i<a.length();i++){
		for (j=0;j<b.size();j++){
			if ((b.get(j)).equals(String.valueOf(a.charAt(i)))==true){
			c.set(j,c.get(j)+1);
					
			break;
			}
		}
		if (j==b.size()){	
		b.add(String.valueOf(a.charAt(i)));
		c.add((long)1);
		}
		
		
	}
	for (i=0;i<c.size();i++){
	d=d+c.get(i)*c.get(i);
	
	}
	System.out.println(d);
	
	}
}