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;
const double pi = acos(-1.0);
const double eps = 1e-6;
char s[100005];
int num[1005];
int main() {
  memset(num, 0, sizeof(num));
  scanf("%s", s);
  int n = strlen(s), maxn = 0, minn = 1005;
  for (int i = 0; i < n; i++) {
    num[s[i]]++;
    minn = min(minn, (int)s[i]);
    maxn = max(maxn, (int)s[i]);
  }
  long long ans = 0;
  for (int i = minn; i <= maxn; i++)
    if (num[i]) ans += (long long)num[i] * (long long)num[i];
  printf("%lld\n", ans);
  return 0;
}