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;
long long ff[38], ans;
int main() {
  char a[100011];
  long long i, j, k;
  scanf("%s", a);
  k = strlen(a);
  for (i = 0; i < k; i++) {
    if (a[i] >= '0' && a[i] <= '9')
      ff[a[i] - '0']++;
    else
      ff[a[i] - 'a' + 10]++;
  }
  for (i = 0; i < 38; i++) {
    ans = ans + ff[i] * ff[i];
  }
  printf("%I64d\n", ans);
}