Chef and Ridges PRDRG

All submissions for this problem are available.###Read problems statements Hindi , Vietnamese , Mandarin Chinese , Russian and Bengali as well.

We have a rectangular piece of cardboard with width $1$ (its height is not important). We are going to fold it in the following way:

Whenever the cardboard is folded, exactly one of its new sides is a newly formed ridge (there may be more, internal ridges formed, but we do not consider these). Let’s denote such a ridge created in the $k$-th folding by $R_k$.

In total, we fold the piece of cardboard $N$ times. Afterwards, we unfold it and look at the formed ridges. Let’s denote the distance of ridge $R_N$ (i.e. the last formed outer ridge) from the left side of the original piece of cardboard by $D_N$. For example, $D_1 = 1/2$ and $D_2 = 1/4$.

It is possible to express $D_N$ as an irreducible fraction $x/y$. Find this fraction.

Assume that it is possible to fold the piece of cardboard as many times as we want.

Input

The first and only line of the input contains a single integer $T$ denoting the number of test cases. For each test case, a space and an integer $N$ follows.

Output

Print a single line containing $2T$ space-separated integers. For the $i$-th test case ($1 \le i \le T$), the $2i-1$-th and $2i$-th integer should denote $x$ and $y$ — the position of the last ridge as an irreducible fraction.

Constraints

Subtask #1 (10 points):

Subtask #2 (90 points): original constraints

Example Input

2 1 2

Example Output

1 2 1 4

Explanation

Example case 1: We only fold once, so $x=1$ and $y=2$.

Example case 2: We fold the piece of cardboard twice. The last edge is at $1/4$, so $x=1$ and $y=4$.