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 int A[10] = {}, B[26] = {};
  for (long long int i = 0; i < S.size(); i++) {
    if (S[i] >= 48 && S[i] <= 57) {
      A[S[i] - 48]++;
    } else {
      B[S[i] - 97]++;
    }
  }
  long long int total = S.size();
  for (long long int i = 0; i < 10; i++) {
    if (A[i] > 1) {
      total = total + ((A[i] - 1) * A[i]);
    }
  }
  for (long long int i = 0; i < 26; i++) {
    if (B[i] > 1) {
      total = total + ((B[i] - 1) * B[i]);
    }
  }
  cout << total << endl;
}