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_base::sync_with_stdio(false);
  cin.tie(NULL);
  string a;
  long long g[11111], b[111111];
  cin >> a;
  for (long long i = 0; i < a.size(); i++) {
    if (a[i] - 48 >= 0 && a[i] - 48 <= 9)
      g[a[i] - 48]++;
    else
      b[a[i] - 97]++;
  }
  long long res = 0;
  for (long long i = 0; i <= 9; i++) res += g[i] * g[i];
  for (long long i = 0; i < 26; i++) res += b[i] * b[i];
  cout << res;
  return 0;
}