In the metaphysical world of the Matrix, different people make their chessboards with their own specifications. Sometimes they play multidimensional chess being in multiple positions. For now, let's think that they can choose N x N chessboards and have fun playing chess. While they are having fun, we want to know that if we choose any rectangle from the chessboard, what is the probability that the chosen rectangle is not a square.

Input

The first line of input consists of a single integer T $( 1 \leq T \leq 1000 )$, next T lines contain an integer N $( 1 \leq N \leq 1000 )$, the dimension of the chessboard.

Output

Print the probability of choosing a rectangle that is not a square. Errors less than $10^{-4}$ will be ignored.

Sample

Input	Output
1 8	0.842593