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() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  map<long long, long long> mp, mp2;
  long long ans = 0;
  string str;
  cin >> str;
  for (auto i : str) (i >= '0' && i <= '9') ? mp2[i - '0']++ : mp[i - 'a']++;
  for (long long i = 0; i < 26; i++) {
    if (mp[i]) ans += mp[i] + (mp[i] * (mp[i] - 1));
  }
  for (long long i = 0; i < 10; i++)
    if (mp2[i]) ans += mp2[i] + (mp2[i] * (mp2[i] - 1));
  cout << ans << endl;
  return 0;
}