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 JAVA):

Solution:
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.InputStreamReader;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        C2NotSoSimplePolygonEmbedding solver = new C2NotSoSimplePolygonEmbedding();
        solver.solve(1, in, out);
        out.close();
    }

    static class C2NotSoSimplePolygonEmbedding {
        public void solve(int testNumber, Scanner sc, PrintWriter pw) {
            int t = sc.nextInt();
            while (t-- > 0) {
                int n = sc.nextInt();
                double angle = 360.0 / (2.0 * n);
//            double tmpang = (180.0 - angle )/2;
//            double l = Math.sin(tmpang*Math.PI/ 180) /Math.sin(angle*Math.PI/180);
                double ang2 = 180.0 - (2 * angle + 45);
//            pw.println(l);
//            double k = (l*Math.sin(ang2*Math.PI/180))/Math.sin(angle*Math.PI/180);
//            double ans = k*Math.sqrt(2);
                double ans = 0;
//            n--;
                // pw.println(angle+" " + ang2);
                while (n-- > 0) {
                    ans += Math.abs(Math.cos(ang2 * Math.PI / 180));
                    ang2 += angle;
                }
                pw.println(ans);
            }
        }

    }

    static class Scanner {
        StringTokenizer st;
        BufferedReader br;

        public Scanner(FileReader r) {
            br = new BufferedReader(r);
        }

        public Scanner(InputStream s) {
            br = new BufferedReader(new InputStreamReader(s));
        }

        public String next() {
            while (st == null || !st.hasMoreTokens()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return st.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

    }
}