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.HashMap;
import java.util.Map;
import java.util.Scanner;

public class Main {
  public static void main(String[] args) {
    Scanner in = new Scanner(System.in);
    String s = in.next();
    Map<Character, Integer> map = new HashMap<Character, Integer>();
    for (char c : s.toCharArray() ) {
      if ( !map.containsKey(c) ) {
        map.put(c, 0);
      }
      map.put(c, map.get(c) + 1);
    }
    long sum = 0;
    for ( Integer v : map.values() ) {
      sum += 1l * v * v;
    }
    System.out.println(sum);
    in.close();
  }
}