__Problem:-__

###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:

- pick up the right side of the piece of cardboard and move it to the left until it touches the left side
- this way, a smaller piece of cardboard with width $1\mathrm{/}2$ is created; if we unfolded it, we could see a vertical ridge formed in the middle
- pick up the left side of this new piece of cardboard and move it to the right until it touches the (new) right side
- pick up the right side of the resulting piece of cardboard and move it to the left until it touches the left side, etc.

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 $\ufffd$-th folding by ${\ufffd}_{\ufffd}$.

In total, we fold the piece of cardboard $\ufffd$ times. Afterwards, we unfold it and look at the formed ridges. Let's denote the distance of ridge ${\ufffd}_{\ufffd}$ (i.e. the last formed outer ridge) from the left side of the original piece of cardboard by ${\ufffd}_{\ufffd}$. For example, ${\ufffd}_{1}=1\mathrm{/}2$ and ${\ufffd}_{2}=1\mathrm{/}4$.

It is possible to express ${\ufffd}_{\ufffd}$ as an irreducible fraction $\ufffd\mathrm{/}\ufffd$. 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 $\ufffd$ denoting the number of test cases. For each test case, a space and an integer $\ufffd$ follows.

### Output

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

### Constraints

- $1\le \ufffd\le 5$
- $1\le \ufffd\le 25$

Subtask #1 (10 points):

- $1\le \ufffd\le 5$
- $1\le \ufffd\le 5$

Subtask #2 (90 points): original constraints

### Sample 1:

2 1 2

1 2 1 4

### Explanation:

Example case 1: We only fold once, so $\ufffd=1$ and $\ufffd=2$.

Example case 2: We fold the piece of cardboard twice. The last edge is at $1\mathrm{/}4$, so $\ufffd=1$ and $\ufffd=4$.

__Code(C++):-__

__Code(java):-__

__Recommended Post ____:-__

__Recommended Post__

__:-__

__HCL Coding Questions:-__

__Capgemini Coding Questions:-__

__iMocha coding Questions:-__

__Tech Mahindra coding questions:-__

__Unthinkable Solutions coding questions:-__- Swap the adjacent characters of the string
- Double the vowel characters in the string
- Character with their frequency
- Program to find the closest value

__Must check this:-__

__Companies interview:-__- Swap adjacent characters
- Double the vowel characters
- Check valid parenthesis
- Print the characters with their frequencies
- Find closest value
- Word Count
- Program of CaesarCipher
- Program to find the perfect city
- Annual Day | Tech Mahindra coding question
- Find the number of pairs in the array whose sum is equal to a given target.

__Full C course:- __

__Key points:-__

- How to set limit in the floating value in python
- What is boolean data type
- How to print any character without using format specifier
- How to check that given number is power of 2 or not
- How to fix limit in double and floating numbers after dot (.) in c++
- How to print a double or floating point number in scientific notation and fixed notation
- How to take input a string in c
- How to reduce the execution time of program in c++.

__Cracking the coding interview:-__

__Array and string:-__

__Tree and graph:-__

__Hackerearth Problems:-__

- Very Cool numbers | Hacker earth solution
- Vowel Recognition | Hackerearth practice problem solution
- Birthday party | Hacker earth solution
- Most frequent | hacker earth problem solution
- program to find symetric difference of two sets
- cost of balloons | Hacker earth problem solution
- Chacha o chacha | hacker earth problem solution
- jadu and dna | hacker earth solution
- Bricks game | hacker earth problem
- Anti-Palindrome strings | hacker earth solution
- connected components in the graph | hacker earth data structure
- odd one out || hacker earth problem solution
- Minimum addition | Hackerearth Practice problem
- The magical mountain | Hackerearth Practice problem
- The first overtake | Hackerearth Practice problem

__Hackerrank Problems:-__- Playing With Characters | Hackerrank practice problem solution
- Sum and Difference of Two Numbers | hackerrank practice problem solution
- Functions in C | hackerrank practice problem solution
- Pointers in C | hackerrank practice problem solution
- Conditional Statements in C | Hackerrank practice problem solution
- For Loop in C | hackerrank practice problem solution
- Sum of Digits of a Five Digit Number | hackerrank practice problem solution
- 1D Arrays in C | hackerrank practice problem solution
- Array Reversal | hackerrank practice problem solution
- Printing Tokens | hackerrank practice problem solution
- Digit Frequency | hackerrank practice problem solution
- Calculate the Nth term | hackerrank practice problem solution

__Data structure:-__

- Program to find cycle in the graph
- Implementation of singly link list
- Implementation of queue by using link list
- Algorithm of quick sort
- stack by using link list
- program to find preorder post order and inorder of the binary search tree
- Minimum weight of spanning tree
- Preorder, inorder and post order traversal of the tree

__ MCQs:-__

## 0 Comments