[Solution] AvtoBus Codeforces Solution | Codeforces Problem Solution 2022

[Solution] AvtoBus Codeforces Solution | Codeforces Problem Solution 2022

A. AvtoBus

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Spring has come, and the management of the AvtoBus bus fleet has given the order to replace winter tires with summer tires on all buses.

You own a small bus service business and you have just received an order to replace 𝑛$n$ tires. You know that the bus fleet owns two types of buses: with two axles (these buses have 4$4$ wheels) and with three axles (these buses have 6$6$ wheels).

Solution Click Below:-  CLICK HERE

You don't know how many buses of which type the AvtoBus bus fleet owns, so you wonder how many buses the fleet might have. You have to determine the minimum and the maximum number of buses that can be in the fleet if you know that the total number of wheels for all buses is 𝑛$n$.

Input

The first line contains an integer 𝑡$t$ (1≤𝑡≤1000$1\le t\le 1000$) — the number of test cases. The following lines contain description of test cases.

AvtoBus Codeforces Solution

Stone Age Problem Codeforces Solution

Rooks Defenders Codeforces Solution

Toss a Coin to Your Graph... Codeforces Solution

Typical Party in Dorm Codeforces Solution

Formalism for Formalism Codeforces Solution 

The only line of each test case contains one integer 𝑛$n$ (1≤𝑛≤1018$1\le n\le {10}^{18}$) — the total number of wheels for all buses.

Output

For each test case print the answer in a single line using the following format.

Print two integers 𝑥$x$ and 𝑦$y$ (1≤𝑥≤𝑦$1\le x\le y$) — the minimum and the maximum possible number of buses that can be in the bus fleet.

If there is no suitable number of buses for the given 𝑛$n$, print the number −1$-1$ as the answer.

Join Now for Solution:-