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 t[125];
int main() {
  int i, l;
  char s[100004];
  while (scanf("%s", s) != EOF) {
    l = strlen(s);
    memset(t, 0, sizeof(t));
    for (i = 0; i < l; i++) {
      t[s[i]]++;
    }
    double ans = 0;
    for (i = '0'; i <= 'z'; i++) {
      ans += (double)t[i] * t[i];
    }
    printf("%.0lf\n", ans);
  }
  return 0;
}