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(int argc, char const* argv[]) {
  string s;
  cin >> s;
  long long res = 0;
  while (s.size() > 0) {
    vector<int> l;
    l.push_back(0);
    for (int i = 1; i < s.size(); i++)
      if (s[0] == s[i]) {
        l.push_back(i);
      }
    long long t = l.size();
    res += t * t;
    for (int i = l.size() - 1; i >= 0; i--) {
      s.erase(l[i], 1);
    }
  }
  cout << res << endl;
  return 0;
}