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>
using namespace std;
char s[100010];
int main() {
  int l, i;
  long long a, f;
  while (scanf("%s", s) != EOF) {
    l = strlen(s);
    sort(s, s + l);
    a = 0;
    f = 0;
    for (i = 1; i < l; i++)
      if (s[i] != s[i - 1]) {
        a += pow((f - i), 2);
        f = i;
      }
    a += (long long)((f - i) * (f - i));
    printf("%lld\n", a);
  }
  return 0;
}