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;
int main() {
  ios::sync_with_stdio(false);
  long long int n, i, j, cont;
  string s;
  cin >> s;
  n = s.size();
  cont = 0;
  long long int vet[257];
  for (i = 0; i < 257; i++) vet[i] = 0;
  for (i = 0; i < n; i++)
    if (s[i] < 0)
      vet[(-1 * s[i])]++;
    else
      vet[s[i]]++;
  for (i = 0; i < 257; i++) cont += (vet[i] * vet[i]);
  printf("%lld", cont);
  return 0;
}