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.PrintStream;
import java.math.BigInteger;
import java.util.HashMap;
import java.util.Scanner;


public class Symbol {
  public static void main(String[] args) {
    Scanner s = new Scanner(System.in);
    PrintStream pw = System.out;
    
    String str = s.nextLine();
    Integer val;
    HashMap<Character, Integer> h = new HashMap<Character, Integer>();
    for (int i=0; i<str.length(); i++) {
      char c = str.charAt(i);
      val = h.get(c);
      if (val==null) val = 0; 
      h.put(c, val+1);
    }
    BigInteger total = new BigInteger("0");
    BigInteger aux;
    for (int v: h.values()) {
      aux = new BigInteger(String.format("%d", v));
      total = total.add(aux.multiply(aux));
    }

    pw.println(total);
  }
}