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 counter = 0;
  string s;
  cin >> s;
  long long int array[10] = {};
  long long int letters[26] = {};
  for (unsigned int i = 0; i < s.length(); i++) {
    int d = 0;
    if ((int)s[i] >= 48 and (int) s[i] <= 57) {
      d = (int)(((int)s[i]) - 48);
      array[d] += 1;
    } else {
      d = (int)(((int)s[i]) - 97);
      letters[d] += 1;
    }
  }
  for (unsigned int j = 0; j < 10; j++) {
    counter += (array[j]) * (array[j]);
  }
  for (unsigned int m = 0; m < 26; m++) {
    counter += (letters[m]) * (letters[m]);
  }
  cout << counter << endl;
  return 0;
}