（寒假CF）Choosing Symbol Pairs

//我觉得这题好像跟我理解的不太一样啊T ^ T，有点郁闷 

Description

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.

Sample Input

Input

great10

Output

7

Input

aaaaaaaaaa

Output

100

#include<stdio.h>

#include<string.h>



int t[100000];

 

int main()

{

char s[100000];

while(gets(s))

{

double sum=0;

int l=strlen(s);

memset(t,0,sizeof(t));

for(int i=0;i<l;i++)

{

t[s[i]]++;

}

for(int i='0';i<='z';i++)

{

sum+=(double)t[i]*t[i];

}

printf("%.0lf
",sum);

}

return 0;

}