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 a[2222], b[4];
int d[3][3];
int main() {
  int n = 0, i, j;
  int64_t d = 0, x;
  vector<int> c[128];
  string st;
  cin >> st;
  for (i = 0; i < st.size(); i++) c[st[i]].push_back(i);
  for (i = 48; i < 128; i++) {
    x = c[i].size();
    d += x * x;
  }
  cout << d;
}