You are given an integer sequence of length .
For every non-empty interval , define the following values.
- : the number of distinct integers appearing in
- : the length of the interval, that is,
Find the maximum value of over all possible intervals .
Input
The input is given in the following format.
Output
Print the maximum value of over all non-empty intervals .
Your answer is considered correct if its absolute or relative error is at most .
Constraints
- .
- ().
Subtasks
Samples
예제 1
입력
4
1 2 1 3
출력
3.000000000000
The interval contains . Here and , so .
예제 2
입력
5
7 7 7 7 7
출력
1.000000000000
Choosing any interval of length gives and , so .
해설
관리자가 작성한 해설을 별도 페이지에서 볼 수 있어요.