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;
  long long c[36][2];
  long long cnt = 0;
  for (int k = 0; k < 10; k++) c[k][0] = 48 + k;
  for (int k = 0; k < 26; k++) c[k + 10][0] = 97 + k;
  for (int k = 0; k < 36; k++) c[k][1] = 0;
  for (int i = 0; i < input.length(); i++) {
    for (int j = 0; j < 36; j++) {
      if ((int)input.at(i) == c[j][0]) {
        c[j][1]++;
        break;
      }
    }
  }
  for (int j = 0; j < 36; j++) cnt = cnt + (c[j][1]) * (c[j][1]);
  cout << cnt;
  return 0;
}