Problem: The statement of this problem is the same as the statement of problem C2. The only difference is that, in problem C1, n is always even, and in C2, n is always odd.

You are given a regular polygon with 2 ⋅ n vertices (it's convex and has equal sides and equal angles) and all its sides have length 1. Let's name it as 2n-gon.

Your task is to find the square of the minimum size such that you can embed 2n-gon in the square. Embedding 2n-gon in the square means that you need to place 2n-gon in the square in such way that each point which lies inside or on a border of 2n-gon should also lie inside or on a border of the square.

You can rotate 2n-gon and/or the square.

Input

The first line contains a single integer T (1 ≤ T ≤ 200) — the number of test cases.

Next T lines contain descriptions of test cases — one per line. Each line contains single even integer n (2 ≤ n ≤ 200). Don't forget you need to embed 2n-gon, not an n-gon.

Output

Print T real numbers — one per test case. For each test case, print the minimum length of a side of the square 2n-gon can be embedded in. Your answer will be considered correct if its absolute or relative error doesn't exceed 10^{-6}.

Example

Input


3
2
4
200


Output


1.000000000
2.414213562
127.321336469

Solution (in PYTHON3):

Solution:
import math

def rotate(p, angle):
    ox, oy = 0, 0 
    px, py = p[0], p[1]

    qx = ox + math.cos(angle) * (px - ox) - math.sin(angle) * (py - oy)
    qy = oy + math.sin(angle) * (px - ox) + math.cos(angle) * (py - oy)
    
    return [qx, qy]

def get(P, angle):
    P_  =  [rotate(p, angle) for p in P]
    minX, minY, maxX, maxY = float('inf'), float('inf'), -float('inf'), -float('inf')
    
    for x, y in P_:
        if x < minX:
            minX = x
        if x > maxX:
            maxX = x
        if y < minY:
            minY = y
        if y > maxY:
            maxY = y
            
    return max(maxX-minX, maxY - minY)        

def solve():
    n     = int(input())
    N     = 2 * n
    pi    = math.pi
    alpha = pi / n
    r     = 0.5 / math.sin(alpha / 2)

    P  = [[r * math.cos(2 * pi * i / N), r * math.sin(2 * pi * i / N)] for i in range(N)] 

    l, r  =  0, pi / (2*n)

    while r - l > 1e-8:
        md1  =  l + (r - l) / 3
        md2  =  r - (r - l) / 3

        if get(P, md1) < get(P, md2):
            r  = md2
        else:
            l  = md1
        
    print(get(P, (l+r) / 2))

for _ in range(int(input())):
    solve()