A. Legs for the Olympiad
time limit per test
1 second
memory limit per test
512 megabytes
input
standard input
output
standard output

Kostya is preparing a venue for a team olympiad. Each team needs one table and three stools.

Fortunately, the school warehouse has an unlimited number of tabletops and stool seats, but the legs of school furniture often break, so Kostya ordered $$$n$$$ identical legs for tables and stools from a furniture workshop. Each table must have four legs, and each stool must have three legs.

Three school students participate in the team olympiad, so each team needs one table and three stools. Kostya assembles the furniture as follows:

  1. He assembles three stools, if there are enough legs for them.
  2. If he managed to assemble three stools, he assembles one table, if there are enough legs for it.
  3. He repeats steps 1 and 2 while there are enough legs.
  4. If there are not enough legs for step 1 or 2, he assembles the maximum possible number of stools from all remaining legs and stops. These stools will be kept as spares in case something breaks during the olympiad.

Kostya is very busy assembling the furniture, so help him answer the question of how many tables and stools he will be able to assemble.

Input

The first line of input contains the integer $$$n$$$ $$$(1 \le n \le 10^{18})$$$.

Output

Print two integers separated by a space — the number of tables and stools, respectively, that Kostya will be able to assemble.

Examples
Input
3
Output
0 1
Input
18
Output
1 4