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

public class ChoosingSymbolPairs {

	static void solve(){
		Scanner sc = new Scanner(System.in);
		String s = sc.next();
		StringBuilder sb = new StringBuilder();
		long[] ch = new long[256];
		int len = s.length();
		long sum = 0;
		for (char c: s.toCharArray()) { 
			if (ch[(int)c]==0) sb.append(c); 
			ch[(int)c]++;
		}
		for (char c: sb.toString().toCharArray()) sum+=(ch[(int)c]*ch[(int)c]);
		System.out.println(sum);
		sc.close();
	}

	public static void main(String args[]) {
		solve();
	}

}