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 CPP):

Solution:
#include <bits/stdc++.h>
int main() {
  char str[1000001];
  gets(str);
  int n = strlen(str);
  int i, j, k = -1;
  long long int sum = 0, ans[n];
  for (i = 0; i < n; i++) {
    if (str[i] != '*') {
      k++;
      ans[k] = 1;
      for (j = i + 1; j < n; j++)
        if (str[i] == str[j]) {
          ans[k]++;
          str[j] = '*';
        }
    }
  }
  for (i = 0; i <= k; i++) {
    sum = sum + (ans[i] * ans[i]);
  }
  printf("%I64d", sum);
  return 0;
}