Codeforces 100187B：A Lot of Joy（数学期望）

B. A Lot of Joy

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Two boys Gena and Petya wrote on two strips of paper the same string s that consisted of lowercase Latin letters. Then each boy took one strip, cut it into small pieces so that each piece contained exactly one letter and put all pieces into his pocket. After that Gena and Petya repeated the following procedure until their pockets became empty: they took one piece from their pockets and rejoiced if the letters on these pieces were equal.

Determine the expected number of times the boys rejoiced during this process.

Input

The input contains the only string s which was initially written on Gena's and Petya's strips. The string has length between1 and200000, inclusively, and consists of lowercase Latin letters.

Output

Output the only real number — the expected number of times Gena and Petya rejoiced during their business. The absolute or relative error of the answer should not exceed10^- 9.

Examples

Input

abc

Output

1.000000000000000

Input

zzz

Output

3.000000000000000

题目大意：给你一个字符串，然后把这些字符串弄成两份，一人一份，每个人把所得的字符串都撕成单个的字母，俩人把斯好的纸片放进口袋。然后两个人同时拿出来一片

纸片，若两人所拿出的纸片上的字母一样，那么愉悦度+1，这样进行下去，直到俩人口袋的纸片都没了为止。求愉悦度的期望值。

代码如下：

#include <cstdio>
#include <cstring>
char s[200010];
int cnt[30];
int main()
{
	scanf("%s",&s);
	int n=strlen(s);
	for(int i=0;i<n;i++)
	{
		cnt[s[i]-'a']++;
	}
	double ans=0.0;
	for(int i=0;i<n;i++)
	{
		ans=ans+(double)cnt[s[i]-'a'];
	}
	printf("%.9lf\n",ans/(double)n);
	return 0;
 }