# Gym - 100187B（期望）

Statements

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 between 1 and 200000, 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 exceed 10 - 9.

Examples

Input

abc


Output

1.000000000000000


Input

zzz


Output

3.000000000000000

求出每个字母的期望。

#include <iostream>
#include <stdio.h>
#include <string.h>

using namespace std;

const int maxn = 200005;
char s[maxn];
int a[50];
int main()
{
memset(s,'\0',sizeof(s));
scanf("%s",s);
int n = strlen(s);
memset(a, 0 ,sizeof(a));

double sum = 0.0;
for(int i = 0 ;i < n;i ++)
{
sum += (double)a[s[i]-'a'];
}
sum /= n;
printf("%.9lf\n",sum);
return 0;
}