题面:
An integer sequence with length nn, denoted by a1,a2,⋯,ana1,a2,⋯,an, is generated randomly, and the probability of being 1,2,⋯,n1,2,⋯,n are all 1n1n for each aiai (i=1,2,⋯,n)(i=1,2,⋯,n).
Your task is to calculate the expected number of permutations p1,p2,⋯,pnp1,p2,⋯,pn from 11 to nn such that pi≤aipi≤ai holds for each i=1,2,⋯,ni=1,2,⋯,n.
Input
The only line contains an integer nn (1≤n≤50)(1≤n≤50).
Output
Output the expected number of permutations satisfying the condition. Your answer is acceptable if its absolute or relative error does not exceed 10−910−9.
Formally speaking, suppose that your output is xx and the jury's answer is yy. Your output is accepted if and only if |x−y|max(1,|y|)≤10−9|x−y|max(1,|y|)≤10−9.
Examples
input
Copy</