A11641 | Game with String

Vasya and Kolya play a game with a string, using the following rules. Initially, Kolya creates a string $s$ , consisting of small English letters, and uniformly at random chooses an integer $k$ from a segment $[0,len(s)-1]$ . He tells Vasya this string $s$ , and then shifts it $k$ letters to the left, i. e. creates a new string $t=s_{k+1}s_{k+2}...\ s_{n}s_{1}s_{2}...\ s_{k}$ . Vasya does not know the integer $k$ nor the string $t$ , but he wants to guess the integer $k$ . To do this, he asks Kolya to tell him the first letter of the new string, and then, after he sees it, open one more letter on some position, which Vasya can choose.

Vasya understands, that he can't guarantee that he will win, but he wants to know the probability of winning, if he plays optimally. He wants you to compute this probability.

Note that Vasya wants to know the value of $k$ uniquely, it means, that if there are at least two cyclic shifts of $s$ that fit the information Vasya knowns, Vasya loses. Of course, at any moment of the game Vasya wants to maximize the probability of his win.

The only string contains the string $s$ of length $l$ $(3<=l<=5000)$ , consisting of small English letters only.

Print the only number — the answer for the problem. You answer is considered correct, if its absolute or relative error does not exceed $10^{-6}$ .

Formally, let your answer be $a$ , and the jury's answer be $b$ . Your answer is considered correct if