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 n, i, j, vis[100010] = {0};
  long long s = 0, k;
  char a[2][100010];
  scanf("%s", a[1]);
  n = strlen(a[1]);
  for (i = 0; i < n; i++) {
    k = 0;
    if (vis[i] == 0) {
      for (j = i; j < n; j++)
        if (a[1][j] == a[1][i]) {
          k++;
          vis[j] = 1;
        }
    }
    s += k * k;
  }
  printf("%I64d\n", s);
  return 0;
}