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>
#pragma warning(disable : 4786)
using namespace std;
char str[100005];
int f[300];
int main() {
  int i, j, k, tests, cs = 0, n;
  scanf("%s", str);
  for (i = 0; str[i]; i++) f[str[i]]++;
  long long ans = 0;
  for (i = 0; i < 300; i++) {
    if (!f[i]) continue;
    ans += (long long)f[i] * f[i];
  }
  printf("%I64d\n", ans);
  return 0;
}