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() {
  long long unsigned S = 0, t, a[36];
  for (int i = 0; i < 36; i++) a[i] = 0;
  string s;
  cin >> s;
  for (int i = 0; i < s.size(); i++) {
    if (int(s[i]) >= '0' && int(s[i]) <= '9')
      a[int(s[i]) - 48]++;
    else if (s[i] <= 'z' && s[i] >= 'a')
      a[int(s[i]) - 87]++;
  }
  for (int i = 0; i < 36; i++) {
    t = a[i] * a[i];
    S += a[i] * a[i];
  }
  cout << S;
  return 0;
}