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:
/* 
* @Author: steve
* @Date:   2015-03-26 23:57:24
* @Last Modified by:   steve
* @Last Modified time: 2015-03-27 00:13:53
*/
import java.io.*;
import java.util.*;

public class ChoosingSymbolPairs {
    public static void main(String[] args) throws Exception{
    	BufferedReader entrada = new BufferedReader(new InputStreamReader(System.in));
    	String cad=entrada.readLine();
    	HashMap<Character,Integer> mapa = new HashMap<Character,Integer>();
    	for(int i=0;i<cad.length();i++){
    		if(mapa.containsKey(cad.charAt(i))){
    			mapa.put(cad.charAt(i),mapa.get(cad.charAt(i))+1);
    		}else{
    			mapa.put(cad.charAt(i),1);
    		}
    	}
    	long cant=0;
    	for(int i=0;i<26;i++){
    		char aux=(char) (97+i);
    		if(mapa.containsKey(aux)){
    			cant+=Math.pow(mapa.get(aux),2);
    		}
    	}
    	for(int i=0;i<10;i++){
    		char aux=(char) ('0'+i);
    		if(mapa.containsKey(aux)){
    			cant+=Math.pow(mapa.get(aux),2);
    		}
    	}
    	System.out.println(cant);
    }
}