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.*;
import java.io.*;
import static java.lang.Math.*;
import java.math.*;

public class Main implements Runnable {
	BufferedReader in; 
	PrintStream out; 
	StringTokenizer st;
	static boolean local = false;

	public static void main(String [] args) throws Exception {
		if (args.length > 0 && args[0].equals("local")) local = true;
		new Thread(new Main()).start();
	}

	public void run() {
		try {
			Locale.setDefault(Locale.US);
			
			if (local) {
				in = new BufferedReader(new FileReader("input.txt"));
				out = new PrintStream("output.txt");
			}
			else {
				in = new BufferedReader(new InputStreamReader(System.in));
				out = new PrintStream(System.out);
			}
			st = new StringTokenizer("");

			char [] c = in.readLine().toCharArray();

			long [] cnt = new long[600];
			for (char x: c) {
				cnt[x]++;
			}

			long ans = 0;
			for (int i = 0; i < 600; i++) {
				ans += cnt[i] * (cnt[i]);
			}

			out.println(ans);


			out.close();                                
		} catch (Exception e) {
			e.printStackTrace();
			out.close();
		}		
	}


	boolean seekForToken() {
 		try {
			while (!st.hasMoreTokens()) {
				String s = in.readLine();
				if (s == null) {
				 	return false;
				}
			 	st = new StringTokenizer(s);
			}
			return true;
		}
		catch (IOException e) {
		 	e.printStackTrace();
		 	return false;
		}
 	}

 	int nextInt() {
		return Integer.parseInt(nextToken());
 	}

 	long nextLong() {
		return Long.parseLong(nextToken());
 	}

 	double nextDouble() {
		return Double.parseDouble(nextToken());
 	}

 	BigInteger nextBigInteger() {
 	 	return new BigInteger(nextToken());
 	}

 	String nextToken() {
 	 	seekForToken();
 	 	return st.nextToken();
 	}

}