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 C(int n, int r) {
  if (r > n / 2) r = n - r;
  long long ans = 1;
  int i;
  for (i = 1; i <= r; i++) {
    ans *= n - r + i;
    ans /= i;
  }
  return ans;
}
int main() {
  string s;
  cin >> s;
  long long unsigned ans = 0;
  int l = s.length();
  int c[200] = {0};
  for (int i = 0; i < l; i++) {
    int x = (int)(s[i]);
    c[x]++;
  }
  ans += l;
  for (int i = 0; i < 200; i++) {
    if (c[i] >= 2) {
      ans += C(c[i], 2) * 2;
    }
  }
  cout << ans;
  return 0;
}