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 input;
  cin >> input;
  int count[256] = {0};
  for (int i = 0; i < input.size(); ++i) {
    count[input[i]]++;
  }
  long long sum = 0;
  for (int i = 0; i < 256; ++i) {
    if (count[i] == 1) {
      sum += 1;
    } else if (count[i] > 0) {
      sum += ((((long long)count[i]) * (count[i] - 1)));
      sum += count[i];
    }
  }
  cout << sum << endl;
  return 0;
}