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.BufferedInputStream;
import java.io.IOException;
import java.util.Scanner;

//http://codeforces.com/problemset/problem/50/B
public class B55 {
	public static void main(String[] args) throws IOException {
		solveChoosingSymbolPairs();
	}
	
	public static void solveChoosingSymbolPairs()throws IOException{
		Scanner scan = new Scanner(new BufferedInputStream(System.in));
		long counter[] = new long[256];
		char str[] = scan.nextLine().toCharArray();
		
		for (int i = 0; i < str.length; i++) {
			counter[str[i]]++;
		}

		long ans = str.length;
		for (int i = 0; i < 256; i++) {
			if(counter[i] >= 2){
				ans += counter[i] * (counter[i] - 1);
			}
		}
		System.out.println(ans);
		scan.close();
	}
}