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.*;

public class CF50B {
	public static void main(String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		char[] cc = br.readLine().toCharArray();
		int[] aa = new int[10 + 26];
		for (int i = 0; i < cc.length; i++) {
			char c = cc[i];
			if (c >= '0' && c <= '9')
				aa[c - '0']++;
			else
				aa[c - 'a' + 10]++;
		}
		long cnt = 0;
		for (int j = 0; j < 10 + 26; j++)
			cnt += (long) aa[j] * aa[j];
		System.out.println(cnt);
	}
}