Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

The problem statement has recently been changed. View the changes.

×
E. Hexagons

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputAyrat is looking for the perfect code. He decided to start his search from an infinite field tiled by hexagons. For convenience the coordinate system is introduced, take a look at the picture to see how the coordinates of hexagon are defined:

Ayrat is searching through the field. He started at point (0, 0) and is moving along the spiral (see second picture). Sometimes he forgets where he is now. Help Ayrat determine his location after *n* moves.

Input

The only line of the input contains integer *n* (0 ≤ *n* ≤ 10^{18}) — the number of Ayrat's moves.

Output

Print two integers *x* and *y* — current coordinates of Ayrat coordinates.

Examples

Input

3

Output

-2 0

Input

7

Output

3 2

Codeforces (c) Copyright 2010-2021 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: May/13/2021 15:18:32 (i1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|