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:
/**
 * 
 */
//package codeforces;
import java.util.*;
/**
 * @author Shivansh Singh
 *
 */
public class Cf50B {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner sc=new Scanner(System.in);
		int i;
		long s=0;
		String str=sc.next();
		Map<Character,Integer> map=new HashMap<>();
		for (i=0;i<str.length();i++) {
			char ch=str.charAt((int)i);
			if(map.containsKey(ch))
				map.replace(ch,map.get(ch)+1);
			else
				map.put(ch,1);
		}
		for (i=0;i<str.length();i++)
			s+=map.get(str.charAt(i));
		System.out.println(s);
		sc.close();
	}

}