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(void) {
  long long a[65] = {0};
  char c[100005];
  int length;
  long long sum = 0;
  int i, j;
  scanf("%s", c);
  length = strlen(c);
  for (i = 0; i < length; i++) {
    if (c[i] <= 57 && c[i] >= 48) a[c[i] - 48]++;
    if (c[i] >= 65 && c[i] <= 90) a[c[i] - 65 + 11]++;
    if (c[i] >= 97 && c[i] <= 122) a[c[i] - 97 + 37]++;
  }
  for (i = 0; i < 65; i++) sum += a[i] * a[i];
  printf("%I64d\n", sum);
}