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() {
  long long t, i, l, k, j, b[23132], s, n;
  char ch[1000000];
  while (gets(ch)) {
    l = strlen(ch);
    for (k = 0; k < 124; k++) b[k] = 0;
    for (k = 0; k < l; k++) {
      b[ch[k] - 48]++;
    }
    s = 0;
    for (j = 0; j < 124; j++) {
      if (0 < b[j]) s += b[j] * b[j];
    }
    printf("%lld\n", s);
  }
  return 0;
}