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;
inline int cmp(double x, double y = 0, double tol = 1e-10) {
  return (x <= y + tol) ? (x + tol < y) ? -1 : 0 : 1;
}
int vet[150];
int main() {
  char str[100010];
  scanf("%s", str);
  int tam = strlen(str);
  memset(vet, 0, sizeof vet);
  for (int i = 0; i < tam; i++) vet[str[i]]++;
  double ans = 0;
  for (int i = '0'; i <= 'z'; i++) ans += (double)vet[i] * vet[i];
  printf("%.0lf\n", ans);
  return 0;
}