A. Good Target
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Yugandhar was a captain in a gully cricket match. There he needs to chase $$$n$$$ runs as the target. There are some weird rules involved.

  1. There are unlimited balls in a single over.
  2. Only a single batsman will play the match; there is no non-striker player.
  3. The batsman is only allowed to score $$$4$$$ or $$$6$$$ runs on every ball.
  4. It is guaranteed that the batsman can hit $$$4$$$ or $$$6$$$ runs on every ball (the batsman will not score $$$0$$$ runs on his/her chance).

In short, in this problem, a batsman always gets $$$4$$$ or $$$6$$$ points with one ball, and a batsman should get at least $$$n$$$ points in total.

Yugandhar, as a captain, decided to send you as a batsman. So please tell him minimum and maximum balls required for you to chase the target.

Input

Each test contains multiple test cases. The first line contains the number of test cases $$$t$$$ ($$$1 \le t \le 100$$$). The description of the test cases follows.

The first line of each testcase contains a single integer $$$n$$$ ($$$1 \le n \le 10^3$$$) — total runs required to chase.

Output

For each test case, print $$$2$$$ space separated integers — minimum and maximum balls required to chase the target respectively.

Example
Input
4
10
20
30
40
Output
2 3
4 5
5 8
7 10
Note

In the $$$1^{st}$$$ testcase, the batsman can hit $$$10$$$ runs in minimum of $$$2$$$ balls and maximum of $$$3$$$ balls.

One of the possible sequence to hit $$$10$$$ runs in $$$2$$$ balls is $$$4$$$,$$$6$$$.

One of the possible sequence to hit $$$10$$$ runs in $$$3$$$ balls is $$$4$$$,$$$4$$$,$$$6$$$.