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

public class Solution {

	final boolean ONLINE_JUDGE = System.getProperty("ONLINE_JUDGE") != null;

	BufferedReader in;
	PrintWriter out;
	StringTokenizer tok = new StringTokenizer("");

	void init() throws IOException {
		if (ONLINE_JUDGE) {
			in = new BufferedReader(new InputStreamReader(System.in));
			out = new PrintWriter(System.out);
		} else {
			in = new BufferedReader(new FileReader("input.txt"));
			out = new PrintWriter("output.txt");
		}
	}

	String readString() throws IOException {
		while (!tok.hasMoreTokens()) {
			tok = new StringTokenizer(in.readLine());
		}
		return tok.nextToken();
	}

	int readInt() throws IOException {
		return Integer.parseInt(readString());
	}

	public static void main(String[] args) throws IOException {
		new Solution().run();
	}

	public void run() throws IOException {
		long t1 = System.currentTimeMillis();
		init();
		solve();
		out.close();
		long t2 = System.currentTimeMillis();
		System.err.println(t2 - t1);
	}

	void solve() throws IOException {
		char[] s = in.readLine().toCharArray();
		int[] a = new int[256];
		for (int i = 0; i < s.length; i++) {
			a[s[i]]++;
		}
		long ans = 0;
		for (int i = 0; i < 256; i++) {
			ans += ((long) a[i]) * a[i];
		}
		out.print(ans);
	}

}