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>
void mm(char s[]) {
  int m[128] = {0};
  int n, i;
  double nn = 0;
  n = strlen(s);
  for (i = 0; i < n; i++) {
    nn += m[(int)s[i]] * 2 + 1;
    m[(int)s[i]]++;
  }
  printf("%0.0lf\n", nn);
}
int main() {
  char s[100010];
  while (scanf("%s", s) != EOF) mm(s);
  return 0;
}