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;
template <class T>
inline int countbit(T n) {
  return (n == 0) ? 0 : (1 + countbit(n & (n - 1)));
}
template <class T>
inline T gcd(T a, T b) {
  return b ? gcd(b, a % b) : a;
}
const double EPS = 1e-9;
const double PI = acos(-1.0);
long long mem[300];
int main(void) {
  string s;
  cin >> s;
  memset(mem, 0, sizeof(mem));
  for (int i = 0; i < ((int)(s.size())); i++) {
    mem[(int)s[i]]++;
  }
  long long total = 0;
  for (int i = 0; i < 300; i++) {
    total += mem[i] * (mem[i] + 1LL);
  }
  cout << total - (long long)((int)(s.size())) << endl;
  return 0;
}