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.ArrayList;
	import java.util.Arrays;
	import java.util.Collections;
	import java.util.HashMap;
	import java.util.Iterator;
	import java.util.List;
	import java.util.Scanner;
	
	public class SequenceWithDigits {
	
		static Scanner sc= new Scanner(System.in);
		static List<Integer> C;
		static List<Integer> B;
		
		
		
		public static void main(String[] args) {
		
			
			String s=sc.next();
			HashMap<Character,Long> map=new HashMap<>();
			for(int i=0;i<s.length();i++) {
				char key=s.charAt(i);
				if(!map.containsKey(key))map.put(key, 1l);
				else map.put(key, map.get(key)+1l);
				
			}
			long ans=0;
			for(HashMap.Entry<Character,Long> entry:map.entrySet()) {
				ans+=Math.pow(entry.getValue(),2);
			}
			System.out.println(ans);
		}
			
	}