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() {
  string s;
  cin >> s;
  long long len = s.length();
  bool pernah[100005] = {false};
  long long jaw = 0;
  for (long long i = 0; i < len; i++) {
    if (!pernah[i]) {
      long long byk = 0;
      bool woi = false;
      for (long long j = i + 1; j < len; j++) {
        if (!pernah[j]) {
          if (s[i] == s[j]) {
            byk++;
            pernah[i] = true;
            pernah[j] = true;
            woi = true;
          }
        }
      }
      if (woi) {
        byk++;
        jaw += (byk * byk);
      } else {
        jaw++;
      }
    }
  }
  cout << jaw << endl;
  return 0;
}